Irit Dinur
ABSTRACT
We present a polynomial time reduction from gap-3LIN to label cover with 2-to-1 constraints. In the “yes” case the fraction of satisfied constraints is at least 1 −ε, and in the “no” case we show that this fraction is at most ε, assuming a certain (new) combinatorial hypothesis on the Grassmann graph. In other words, we describe a combinatorial hypothesis that implies the 2-to-1 conjecture with imperfect completeness. The companion submitted paper [Dinur, Khot, Kindler, Minzer and Safra, STOC 2018] makes some progress towards proving this hypothesis.
Our work builds on earlier work by a subset of the authors [Khot, Minzer and Safra, STOC 2017] where a slightly different hypothesis was used to obtain hardness of approximating vertex cover to within factor of √2−ε.
The most important implication of this work is (assuming the hypothesis) an NP-hardness gap of 1/2−ε vs. ε for unique games. In addition, we derive optimal NP-hardness for approximating the max-cut-gain problem, NP-hardness of coloring an almost 4-colorable graph with any constant number of colors, and the same √2−ε NP-hardness for approximate vertex cover that was already obtained based on a slightly different hypothesis.
Recent progress towards proving our hypothesis [Barak, Kothari and Steurer, ECCC TR18-077], [Dinur, Khot, Kindler, Minzer and Safra, STOC 2018] directly implies some new unconditional NP-hardness results. These include new points of NP-hardness for unique games and for 2-to-1 and 2-to-2 games. More recently, the full version of our hypothesis was proven [Khot, Minzer and Safra, ECCC TR18-006].
Supplemental Material
- Sanjeev Arora, László Babai, Jacques Stern, and Z. Sweedyk. 1997. The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations. J. Comput. Syst. Sci. 54, 2 (1997), 317–331. Google Scholar
Digital Library
- Sanjeev Arora, Boaz Barak, and David Steurer. 2015. Subexponential Algorithms for Unique Games and Related Problems. J. ACM 62, 5 (2015), 42. org/10.1145/2775105 Google ScholarDigital Library
- Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. 1998. Proof Verification and the Hardness of Approximation Problems. J. ACM 45, 3 (1998), 501–555. Google ScholarDigital Library
- Sanjeev Arora and Shmuel Safra. 1998. Probabilistic Checking of Proofs: A New Characterization of NP. J. ACM 45, 1 (1998), 70–122. 273865.273901 Google ScholarDigital Library
- Sanjeev Arora and Madhu Sudan. 2003. Improved Low-Degree Testing and its Applications. Combinatorica 23, 3 (2003), 365–426. s00493- 003- 0025- 0Google ScholarCross Ref
- Boaz Barak, Pravesh Kothari, and David Steurer. 2018. Small-Set Expansion in Shortcode Graph and the 2-to-1 Conjecture. (2018).Google Scholar
- Personal communication.Google Scholar
- Boaz Barak, Prasad Raghavendra, and David Steurer. 2011. Rounding Semidefinite Programming Hierarchies via Global Correlation. In IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS. 472–481. Google ScholarDigital Library
- Mihir Bellare, Oded Goldreich, and Madhu Sudan. 1998.Google Scholar
- Free Bits, PCPs, and Nonapproximability – Towards Tight Results. SIAM J. Comput. 27, 3 (1998), 804–915. Google ScholarDigital Library
- Irit Dinur and Elazar Goldenberg. 2008. Locally testing direct products in the low error range. In FOCS. Google ScholarDigital Library
- Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, and Muli Safra. 2016. Towards a Proof of the 2-to-1 Games Conjecture? Electronic Colloquium on Computational Complexity (ECCC) 23 (2016), 198. http://eccc.hpiweb.de/report/2016/198 Google ScholarDigital Library
- Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, and Muli Safra. 2017.Google Scholar
- On Non-Optimally Expanding Sets in Grassmann Graphs. Electronic Colloquium on Computational Complexity (ECCC) 24 (2017), 94. https://eccc.weizmann.ac.il/ report/2017/094Google Scholar
- Irit Dinur, Subhash Khot, Will Perkins, and Muli Safra. 2010. Hardness of Finding Independent Sets in Almost 3-Colorable Graphs. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA. 212–221. Google ScholarDigital Library
- Irit Dinur and Omer Reingold. 2006. Assignment Testers: Towards combinatorial proofs of the PCP theorem. SIAM J. Comput. 36, 4 (2006), 975–1024. Special issue on Randomness and Computation. Google ScholarDigital Library
- Irit Dinur and Samuel Safra. 2005. On the Hardness of Approximating Minimum Vertex Cover. Annals of Mathematics 162, 1 (2005), 439–485. http://www.jstor. org/stable/3597377Google ScholarCross Ref
- Irit Dinur and David Steurer. 2014. Analytical approach to parallel repetition. In Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014. 624–633. Google ScholarDigital Library
- Uriel Feige, Shafi Goldwasser, Laszlo Lovász, Shmuel Safra, and Mario Szegedy. 1996. Interactive Proofs and the Hardness of Approximating Cliques. J. ACM 43, 2 (March 1996), 268–292. Google ScholarDigital Library
- Venkatesan Guruswami, Johan Håstad, and Madhu Sudan. 2002.Google Scholar
- Hardness of Approximate Hypergraph Coloring. SIAM J. Comput. 31, 6 (2002), 1663–1686. Google ScholarDigital Library
- Venkatesan Guruswami and Ali Kemal Sinop. 2011. Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives. In IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011. 482–491. Google ScholarDigital Library
- Johan Håstad. 1996. Clique is Hard to Approximate Within n 1 − ε. In 37th Annual Symposium on Foundations of Computer Science, FOCS ’96, Burlington, Vermont, USA, 14-16 October, 1996. 627–636. Google ScholarDigital Library
- Johan Håstad. 2001.Google Scholar
- Some Optimal Inapproximability Results. J. ACM 48, 4 (2001), 798–859. Google ScholarDigital Library
- Russell Impagliazzo, Valentine Kabanets, and Avi Wigderson. 2012. New Direct-Product Testers and 2-Query PCPs. SIAM J. Comput. 41, 6 (2012), 1722–1768.Google ScholarCross Ref
- Subhash Khot. 2002.Google Scholar
- On the Power of Unique 2-Prover 1-Round Games. In Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002. 25. Google ScholarDigital Library
- 1004334Google Scholar
- Subhash Khot. 2010. Inapproximability of NP-complete problems, discrete fourier analysis, and geometry. In Proceedings of the International Congress of Mathematicians 2010. 2676–2697.Google Scholar
- Subhash Khot. 2010.Google Scholar
- On the Unique Games Conjecture. In Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, June 9-12, 2010. 99–121.Google Scholar
- Subhash Khot, Dor Minzer, and Muli Safra. 2017. On independent sets, 2-to-2 games, and Grassmann graphs. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. 576–589. Google ScholarDigital Library
- Subhash Khot, Dor Minzer, and Muli Safra. 2018. Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion. Electronic Colloquium on Computational Complexity (ECCC) 25 (2018), 6. https://eccc.weizmann.ac.il/report/2018/ 006Google Scholar
- Subhash Khot and Dana Moshkovitz. 2016. Candidate Hard Unique Game. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016. 63–76. 1145/2897518.2897531 Google ScholarDigital Library
- Subhash Khot and Ryan O’Donnell. 2009.Google Scholar
- SDP Gaps and UGC-hardness for Max-Cut-Gain. Theory of Computing 5, 1 (2009), 83–117. toc.2009.v005a004Google Scholar
- Ran Raz. 1998. A Parallel Repetition Theorem. SIAM J. Comput. 27, 3 (June 1998), 763–803. Google ScholarDigital Library
- R. Raz and S. Safra. 1997. A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP. 475–484. Google ScholarDigital Library
- Ran Raz and Shmuel Safra. 1997. A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP. In Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997. 475–484. Google ScholarDigital Library
- Ronitt Rubinfeld and Madhu Sudan. 1996. Robust Characterizations of Polynomials with Applications to Program Testing. SIAM J. Comput. 25, 2 (Feb. 1996), 252–271. Google ScholarDigital Library
- D. Steurer. 2011. Subexponential algorithms for d-to-1 two-prover games and for certifying almost perfect expansion. (2011).Google Scholar
Index Terms
- Towards a proof of the 2-to-1 games conjecture?
Recommendations
On non-optimally expanding sets in Grassmann graphs
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingWe study the structure of non-expanding sets in the Grassmann graph. We put forth a hypothesis stating that every small set whose expansion is smaller than 1−δ must be correlated with one of a specified list of sets which are isomorphic to smaller ...
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of $\alpha_{\text{\tiny{GW}}} + \epsilon$ for all $\epsilon > 0$; here $\alpha_{\text{\tiny{GW}}} \approx .878567$ denotes the ...
Composition of low-error 2-query PCPs using decodable PCPs
Property testingThe main result of this paper is a generic composition theorem for low error two-query probabilistically checkable proofs (PCPs). Prior to this work, composition of PCPs was well-understood only in the constant error regime. Existing composition methods ...
Comments