Sciweavers

290 search results - page 48 / 58
» Congruence for Structural Congruences
Sort
View
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
14 years 9 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
TCS
2008
14 years 9 months ago
Verification of qualitative Z constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
Stéphane Demri, Régis Gascon
ENTCS
2002
66views more  ENTCS 2002»
14 years 9 months ago
Rule Formats for Timed Processes
Building on previous work [15,8], this paper describes two syntactic ways of defining `well-behaved' operational semantics for timed processes. In both cases, the rules are d...
Marco Kick
LFCS
2007
Springer
15 years 3 months ago
Cut Elimination in Deduction Modulo by Abstract Completion
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
Guillaume Burel, Claude Kirchner
LPNMR
1990
Springer
15 years 1 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote