Sciweavers

35 search results - page 1 / 7
» An Efficient Parallel Repetition Theorem
Sort
View
STOC
2007
ACM
121views Algorithms» more  STOC 2007»
14 years 5 months ago
An efficient parallel repetition theorem for Arthur-Merlin games
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
TCC
2010
Springer
121views Cryptology» more  TCC 2010»
13 years 3 months ago
An Efficient Parallel Repetition Theorem
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...
Johan Håstad, Rafael Pass, Douglas Wikstr&ou...
COCOON
2010
Springer
13 years 10 months ago
A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model
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...
Ricky Rosen
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
13 years 9 months ago
Derandomized Parallel Repetition Theorems for Free Games
—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...
Ronen Shaltiel
APPROX
2009
Springer
108views Algorithms» more  APPROX 2009»
14 years 1 days ago
Strong Parallel Repetition Theorem for Free Projection Games
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...
Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen ...