1401 search results - page 1 / 281 » Randomness in Interactive Proofs |
STACS
1997
Springer
13 years 9 months ago
1997
Springer
Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In this exposition, we concentrate on three such...
FOCS
1990
IEEE
13 years 9 months ago
1990
IEEE
AAECC
2002
Springer
13 years 5 months ago
2002
Springer
A fruitful interaction between a new randomized WZ procedure and other computer algebra programs is illustrated by the computer proof of a series evaluation that originates from a ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and verifier. The ...
COCO
1994
Springer
13 years 9 months ago
1994
Springer
We study competing-prover one-round interactive proof systems. We show that one-round proof systems in which the rst prover is trying to convince a veri er to accept and the secon...