Parallel repetition in projection games and a concentration bound

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 1-10

  Rao, Anup ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

CHSH game; Parallel repetition; Unique games

Indexed keywords

PROBABILITY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

ALPHABET SIZES; BELL INEQUALITIES; CHSH GAME; CONCENTRATION BOUNDS; HARDNESS OF APPROXIMATIONS; INCREASING FUNCTIONS; NP-HARD; PARALLEL REPETITION; PARALLEL REPETITIONS; QUANTUM GAPS; REPEATED GAMES; UNIQUE GAMES; UNIQUE GAMES CONJECTURES;

GAME THEORY;

EID: 57049092310     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. S. Arora, C, Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and the hardness of approximation problems. Journal of the ACM, 45, 1998.
2. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70-122, Jan. 1998.
3. P. Austrin. Balanced max 2-sat might not be the hardest. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pages 189-197. ACM, 2007.
4. J. Barrett, D. Collins, L. Hardy, A. Kent, and S. Popescu. Quantum nonlocality, bell inequalities and the memory loophole. Physical Review A, 66:042111, 2002.
5. J. S. Bell. On the Einstein-Podolsky-Rosen paradox. Physics, l(3):195-290, 1964.
6. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 113-131, 1988.
7. M. Ben-Or, S, Goldwasser, J. Kilian, and A. Wigderson. Efficient identification schemes using two prover interactive proofs. In Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference, Proceedings, 1989.
8. M. Charikar, K. Makarychev, and Y. Makarychev. Near-optimal algorithms for unique games. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006.
9. S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar. On the hardness of approximating multicut and sparsest-cut. Proceedings of the 21th Annual IEEE Conference on Computational Complexity, 15, 2006.
10. E. Chlamtac, K. Makarychev, and Y. Makarychev. How to play unique games using embeddings. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006.
11. J. F. Clauser, M. A. Home, A. Shimony, and R. A. Holt. Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett., 23(15):880-884, Oct 1969.
12. I. Dinur, E. Mossel, and O. R.egev. Conditional hardness for approximate coloring. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing. ACM, 2006.
13. C. Dwork, U. Feige, J. Kilian, M. Naor, and S. Safra. Low communication 2-prover zero-knowledge proofs for NP. In Advances in Cryptology - CRYPTO '92, 12th Annual International Cryptology Conference. Proceedings, 1992.
14. U. Feige, S. Goldwasser, L. Lovasz, S. Safra, and M. Szegedy. Approximating clique is almost NP-complete (preliminary version). In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, 1991.
15. U. Feige and L. Lovasz. Two-prover one-round proof systems: their power and their problems. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 733-744, 1992.
16. U. Feige and O. Verbitsky. Error reduction by parallel repetition-A negative result. Combinatorica, 22, 2002.
17. R. D. Gill. Accardi contra bell (cum mundi): The impossible coupling. IMS LECTURE NOTES-MONOGRAPH SERIES, 42, 2003.
18. M. Goemans and D. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42, 1995.
19. A. Gupta and K. Talwar. Approximating unique games. In SODA, pages 99-106. ACM Press, 2006.
20. T. Holenstein. Parallel repetition: Simplifications and the no-signaling case. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007.
21. S. Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 767-775, 2002.
22. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for max-cut and other 2-variable CSPs? In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004.
23. S. Khot and O. Regev. Vertex cover might be hard to approximate to within 2-ε. In IEEE Conference on Computational Complexity, page 379. IEEE Computer Society, 2003.
24. 1. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005.
25. D. Lapidot and A. Shamir. A one-round, two-prover, zero-knowledge protocol for NP. Combinatorica, 15, 1995.
26. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 286-293, 1993.
27. E. Mossel, R. O'Donnell, and K. Oleszkiewicz. Noise stability of functions with low in.uences invariance and optimality. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 21-30. IEEE Computer Society, 2005.
28. I. Parnafes, R. Raz, and A. Wigderson. Direct product results and the GCD problem, in old and new communication models. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 363-372, 1997.
29. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, June 1998.
30. R. Raz. A counterexample to strong parallel repetition. Technical Report TR08-018, ECCC: Electronic Colloquium on Computational Complexity, 2008.
31. L. Trevisan, Approximation algorithms for unique games. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, 2005.
32. O. Verbitsky. Towards the parallel repetition conjecture. In Structure in Complexity Theory Conference, pages 304-307, 1994.