Sciweavers

224 search results - page 1 / 45
» A parallel repetition theorem
Sort
View
STOC
2007
ACM
121views Algorithms» more  STOC 2007»
15 years 9 months ago
An efficient parallel repetition theorem for Arthur-Merlin games
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
COCOON
2010
Springer
15 years 2 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
87
Voted
APPROX
2009
Springer
108views Algorithms» more  APPROX 2009»
15 years 4 months 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 ...
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
15 years 1 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
ECCC
2010
82views more  ECCC 2010»
14 years 9 months ago
A Strong Parallel Repetition Theorem for Projection Games on Expanders
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...
Ran Raz