11 search results - page 1 / 3 » Derandomized Parallel Repetition Theorems for Free Games |
COCO
2010
Springer
14 years 1 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...
APPROX
2009
Springer
14 years 4 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...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
COCO
2010
Springer
14 years 20 days ago
2010
Springer
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
COCOON
2010
Springer
14 years 2 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...