1401 search results - page 8 / 281 » Randomness in Interactive Proofs |
COMBINATORICS
2004
14 years 9 months ago
2004
FOCS
1990
IEEE
15 years 1 months ago
1990
IEEE
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an...
86
Voted
SAT
2010
Springer
15 years 1 months ago
2010
Springer
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
FOCS
1999
IEEE
15 years 1 months ago
1999
IEEE
In this paper we introduce quantum interactive proof systems, which are interactive proof systems in which the prover and verifier may perform quantum computations and exchange qu...
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
We show how a polynomial-time prover can commit to an arbitrary finite set Ë of strings so that, later on, he can, for any string Ü, reveal with a proof whether Ü ¾ Ë or Ü ...