Sciweavers

Share
COCO
2010
Springer
198views Algorithms» more  COCO 2010»
10 years 2 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
COCOON
2010
Springer
10 years 3 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
FOCS
2008
IEEE
10 years 4 months ago
Two Query PCP with Sub-Constant Error
We show that the NP-Complete language 3SAT has a PCP verifier that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1). The ver...
Dana Moshkovitz, Ran Raz
FOCS
2008
IEEE
10 years 4 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
APPROX
2009
Springer
108views Algorithms» more  APPROX 2009»
10 years 5 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 ...
STOC
2007
ACM
121views Algorithms» more  STOC 2007»
10 years 10 months ago
An efficient parallel repetition theorem for Arthur-Merlin games
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
books