Sciweavers

COCO
2010
Springer
198views Algorithms» more  COCO 2010»
13 years 8 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