Sciweavers

Share
6 search results - page 1 / 2
» Strong Parallel Repetition Theorem for Free Projection Games
Sort
View
APPROX
2009
Springer
108views Algorithms» more  APPROX 2009»
10 years 6 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 ...
ECCC
2010
82views more  ECCC 2010»
9 years 11 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
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
10 years 3 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
CC
2015
Springer
4 years 7 months ago
A parallel repetition theorem for entangled projection games
We study the behavior of the entangled value of two-player one-round projection games under parallel repetition. We show that for any projection game G of entangled value 1 − ε...
Irit Dinur, David Steurer, Thomas Vidick
FOCS
2008
IEEE
10 years 6 months ago
A Counterexample to Strong Parallel Repetition
The parallel repetition theorem states that for any two-prover game, with value 1 − (for, say, ≤ 1/2), the value of the game repeated in parallel n times is at most (1 − c)...
Ran Raz
books