35 search results - page 2 / 7 » An Efficient Parallel Repetition Theorem |
137
click to vote
ECCC
2010
15 years 5 months ago
2010
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
136
click to vote
COCO
2007
Springer
15 years 11 months ago
2007
Springer
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
136
Voted
STOC
1995
ACM
15 years 8 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
136
Voted
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an ex...