114 search results - page 1 / 23 » Interactive Proof Systems with Polynomially Bounded Strategi... |
COCO
1992
Springer
13 years 11 months ago
1992
Springer
CRYPTO
1991
Springer
13 years 10 months ago
1991
Springer
Recent results in interactive proof systems [?][?] [?] seem to indicate that it is easier for a prover in a single prover interactive proof system to cheat the verifier than it i...
COCO
2008
Springer
13 years 8 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
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...
LOPSTR
1995
Springer
13 years 10 months ago
1995
Springer
We present an automated proof method for constructive logic based on Wallen’s matrix characterization for intuitionistic validity. The proof search strategy extends Bibel’s con...