Rounding parallel repetitions of unique games

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2008, Pages 374-383

  Barak, Boaz ^a,d   Hardt, Moritz ^a,d   Regev, Oded ^b   Haviv, Ishay ^b   Rao, Anup ^c   Steurer, David ^a,d  

^a PRINCETON UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

^d Princeton University

Author keywords

[No Author keywords available]

Indexed keywords

ALPHABET SIZES; MAX CUTS; ODD CYCLES; PARALLEL REPETITIONS; SEMI-DEFINITE RELAXATIONS; SEMIDEFINITE PROGRAMS;

COMPUTERS; FIBER OPTIC CHEMICAL SENSORS;

GAME THEORY;

EID: 57949103885     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2008.55     Document Type: Conference Paper

References (25)

1. S. Aaronson. The ten most annoying ques-tions in quantum computing, 2006. Available at http://scottaaronson.com/blog/?p=112.
2. K. Azimian and M. Szegedy. Parallel repetition of the odd cycle game. In LATIN, pages 676-686, 2008.
3. J. S. Bell. On the Einstein-Podolsky-Rosen paradox. Physics, 1(3): 195-290, 1964.
4. A. Broder. On the resemblance and containment of documents. In Proc. Compression and Complexity of Sequences, pages 21-29. IEEE, 1997.
5. M. Charikar, K. Makarychev, and Y. Makarychev. Near-optimal algorithms for unique games. In Proc. 38th STOC, pages 205-214. ACM, 2006.
6. M. S. Charikar. Similarity estimation techniques from rounding algorithms. In Proc. 34th STOC, pages 380-388. ACM, 2002.
7. E. Chlamtac, K. Makarychev, and Y. Makarychev. How to play unique games using embeddings. In Proc. 41th FOCS, pages 687-696. IEEE, 2006.
8. 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.
9. U. Feige, G. Kindler, and R. O'Donnell. Understanding parallel repetition requires understanding foams. In IEEE Conference on Computational Complexity, pages 179-192, 2007.
10. U. Feige and L. Lovász. Two-prover one-round proof systems: Their power and their problems. In Proc. 24th STOC, pages 733-741. ACM, 1992.
11. A. Gibbs and F. Su. On choosing and bounding probability metrics. International Statistical Review, 70(3):419-435, 2002. Available as eprint arXiv:math/020902.1v1.
12. J. Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, 2001. Preliminary version in STOC'97.
13. T. Holenstein. Parallel repetition: simplifications and the nosignaling case. In Proc. 39th STOC, pages 411-419. ACM, 2007.
14. J. Kempe, O. Regev, and B. Toner. Unique games with entangled provers are easy. In Proc. 49th FOCS. IEEE, 2008. Available as eprint arXiv:0710.0655.
15. S. Khot. On the power of unique 2-prover 1-round, games. In Proc. 34th STOC, pages 767-775. ACM, 2002.
16. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput, 37(1):319-357, 2007. Preliminary version in FOCS' 04.
17. 1. In Proc. 46th FOCS, pages 53-62. IEEE, 2005.
18. G. Kindler, R. O'Donnell, A. Rao, and A. Wigderson. Rounding schemes and cubical tilings with sphere-like surface area. In Proc. 49th FOCS. IEEE, 2008.
19. J. M. Kleinberg and E. Tardos. Approximation algorithms for classification problems with pairwise relationships: metric labeling and markov random fields. J. ACM, 49(5):616-639, 2002. Preliminary version in STOC'99.
20. C. Kraft. Some Conditions for Consistency and Uniform Consistency of Statistical Procedures. University of California Press, 1955.
21. R. Mittal and M. Szegedy. Product rules in semidefinite programming. In Proc. 16th FCT, pages 435-445. Springer, 2007.
22. D. Pollard. A user's guide to measure theoretic probability. Cambridge University Press, 2002.
23. A. Rao. Parallel repetition in projection games and a concentration bound. In Proc. 40th STOC, pages 1-10. ACM, 2008. Technical report available on ECCC as report TR08-013.
24. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, June 1998. Preliminary version in STOC'95.
25. R. Raz. A counterexample to strong parallel repetition. In Proc. 49th FOCS. IEEE, 2008. Technical report available on ECCC as report TR08-018.