9 search results - page 1 / 2 » An efficient parallel repetition theorem for Arthur-Merlin g... |
STOC
2007
ACM
14 years 4 months ago
2007
ACM
TCC
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We present a general parallel-repetition theorem with an efficient reduction. As a corollary of this theorem we establish that parallel repetition reduces the soundness e...
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
COCO
2010
Springer
13 years 8 months ago
2010
Springer
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
COCOON
2010
Springer
13 years 9 months ago
2010
Springer
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...