Understanding parallel repetition requires understanding foams

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2007, Pages 179-192

  Feige, Uriel ^a   Kindler, Guy ^b   O'Donnell, Ryan ^c  

^a MICROSOFT RESEARCH   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; FINITE DIFFERENCE METHOD; GAME THEORY; HARMONIC ANALYSIS; PROBLEM SOLVING;

DISCRETE HARMONIC ANALYSIS; HIGH-DIMENSIONAL FOAMS; LOWER BOUNDS; PARALLEL REPETITION;

PARALLEL PROGRAMMING;

EID: 34848901667     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2007.39     Document Type: Conference Paper

References (38)

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(3):501-555, 1998.
2. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70-122, 1998.
3. 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.
4. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: How to remove intractability. In Proc. 20th ACM Symp. on the Theory of Computing, pages 113-131, 1988.
5. B. Bollobás, G. Kindler, I. Leader, and R. O'Donnell. Eliminating cycles in the discrete torus. In Proc. 7th LATIN, pages 202-210, 2006.
6. S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, and D. Sivakumar. On the hardness of approximating Multicut and Sparsest-Cut. In Proc. 20th IEEE Confence on Computational Complexity, pages 144-153, 2005.
7. J. Choe. On the existence and regularity of fundamental domains with least boundary area. J. Differential Geom., 29:623-663, 1989.
8. R. Cleve, W. Slofstra, F. Unger, and S. Upadhyay. Strong parallel repetition theorem for quantum XOR proof systems, 2006. arXiv:quant-ph/0608146.
9. I. Dinur, E. Mossel, and O. Regev. Conditional hardness for approximate coloring. In Proc. 38th ACM Symp. on the Theory of Computing, pages 344-353, 2006.
10. U. Feige. On the success probability of the two provers in one round proof systems. In Proc. 6th IEEE Symp. on Structure in Complexity Theory (CCC), pages 116-123, 1991.
11. U. Feige. Error reduction by parallel repetition - the state of the art. Available on the author's home page, 1995.
12. U. Feige and M. Goemans. Approximating the value of two prover proof systems, with applications to MAX-2SAT and MAX-DICUT. In Proc. 3rd Israel Symp. on Theory of Comp. and Sys., pages 182-189, 1995.
13. U. Feige and J. Kilian. Two-prover protocols - low error at affordable rates. SIAM Journal on Computing, 30(1):324-346, 2000. (Conference version in STOC '94.).
14. U. Feige and L. Lovász. Two-prover one-round proof systems, their power and their problems. In Proc. 24th ACM Symp. on the Theory of Computing, pages 733-744, 1992.
15. U. Feige and O. Verbitsky. Error reduction by parallel repetition - A negative result. Combinatorica, 22(4):461-478, 2002.
16. L. Fortnow. Complexity-theoretic aspects of interactive proof systems. Technical Report (Ph.D. thesis) MIT-LCS//MIT/LCS/TR-447, 1989.
17. M. Goemans and D. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42:1115-1145, 1995.
18. T. Hales. Cannonballs and honeycombs. Notices of the AMS, 47:440-449, 200.
19. T. Hales. The honeycomb conjecture. Disc, and Comp. Geom., 25:1-22, 2001.
20. J. Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, 2001.
21. T. Holenstein. Parallel repetition: simplifications and the no-signaling case, 2006. http://arxiv.org/abs/cs.CC/0607139.
22. S. Khot. On the power of unique 2-prover 1-round games. In Proc. 34th ACM Symp. on the Theory of Computing, pages 767-775, 2002.
23. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? In Proc. 45th IEEE Symp. on Foundations of Comp. Sci., pages 146-154, 2004.
24. S. Khot and R. O'Donnell. SDP gaps and UGC-hardness for MaxCutGain. In Proc. 47th IEEE Symp. on Foundations of Comp. Sci., 2006.
25. S. Khot and O. Regev. Vertex Cover might be hard to approximate to within 2 - ε. In Proc. 18th IEEE Confence on Computational Complexity, pages 379-386, 2003.
26. 1. In Proc. 46th IEEE Symp. on Foundations of Comp. Sci., pages 53-62, 2005.
27. S. Lhuilier. Mémoire sur le minimum de cire des alvéoles des abeilles & en particulier sur un minimum minimorum relatif à cette matière. Nouveaux Mémoires de l'Académie Royale des Sciences et Belles-Lettres, pages 277-300, 1781.
28. E. Mossel, R. O'Donnell, and K. Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality. In Proc. 46th IEEE Symp. on Foundations of Comp. Sci., pages 21-30, 2005.
29. E. Mossel, R. O'Donnell, O. Regev, J. Steif, and B. Sudakov. Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality. Israel J. of Math., 154:299-336, 2006.
30. J. Plateau. Statique expérimentale et théoretique des liquides soumis aux seules forces moléculaires. Gauthier-Villars, Paris, 1873.
31. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, 1998. (Conference version in STOC '95.).
32. M. Saks, A. Samorodnitsky, and L. Zosin. A lower bound on the integrality gap for Minimum Multicut in directed networks. Combinatorica, 24(3):525-530, 2004.
33. A. Samorodnitsky and L. Trevisan. Gowers uniformity, influence of variables, and PCPs. In Proc. 38th ACM Symp. on the Theory of Computing, pages 11-20, 2006.
34. J. Sullivan and F. Morgan eds. Open problems in soap bubble geometry. Intl. J. Math., 7:833-842, 1996.
35. W. Thomson. On the division of space with minimum partitional area. Philos. Mag. Lett., 24:503-514, 1887.
36. L. Trevisan, G. Sorkin, M. Sudan, and D. Williamson. Gadgets, approximation, and linear programming. SIAM Journal on Computing, 29(6):2074-2097, 2000.
37. D. Weaire, N. Kern, S. Cox, J. Sullivan, and F. Morgan. Pressures in periodic foams. Proc. Royal Soc. London A, 460(2042):569-579, 2004.
38. D. Weaire and R. Phelan. A counter-example to Kelvin's Conjecture on minimal surfaces. Philos. Mag. Lett., 69(2):107-110, 1994.