Strong Parallel Repetition Theorem for Free Projection Games

@inproceedings{Barak2009StrongPR,
  title={Strong Parallel Repetition Theorem for Free Projection Games},
  author={Boaz Barak and Anup Rao and Ran Raz and Ricky Rosen and Ronen Shaltiel},
  booktitle={APPROX-RANDOM},
  year={2009}
}
The parallel repetition theorem states that for any two provers one round game with value at most 1 − 2 (for 2 < 1/2), the value of the game repeated n times in parallel is at most (1−23)Ω(n/ log s) where s is the size of the answers set [Raz98],[Hol07]. For Projection Games the bound on the value of the game repeated n times in parallel was improved to (1−22)Ω(n) [Rao08] and was shown to be tight [Raz08]. In this paper we show that if the questions are taken according to a product distribution… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS
24 Citations
12 References
Similar Papers

Similar Papers

Loading similar papers…