261 search results - page 6 / 53 » Proof Normalization Modulo |
MPC
1998
Springer
13 years 11 months ago
1998
Springer
Program derivation methodology is applied to reconstruct Euler's proof that every prime congruent to 1 modulo 4 is the sum of two squares.
IPL
2006
13 years 6 months ago
2006
In this paper, we propose a new proof method for strong normalization of calculi with control operators, and, by this method, we prove strong normalization of the system
FM
2003
Springer
13 years 12 months ago
2003
Springer
As the systems we have to specify and verify become larger and more complex, there is a mounting need to combine different tools and decision procedures to accomplish large proof ...
EUROCRYPT
1999
Springer
13 years 11 months ago
1999
Springer
We examine the concurrent composition of zero-knowledge proofs. By concurrent composition, we indicate a single prover that is involved in multiple, simultaneous zero-knowledge pro...
CC
2010
Springer
13 years 1 months ago
2010
Springer
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...