Document Open Access Logo

Lower Bounds for CSP Refutation by SDP Hierarchies

Authors Ryuhei Mori, David Witmer



PDF
Thumbnail PDF

File

LIPIcs.APPROX-RANDOM.2016.41.pdf
  • Filesize: 0.62 MB
  • 30 pages

Document Identifiers

Author Details

Ryuhei Mori
David Witmer

Cite AsGet BibTex

Ryuhei Mori and David Witmer. Lower Bounds for CSP Refutation by SDP Hierarchies. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 60, pp. 41:1-41:30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.41

Abstract

For a k-ary predicate P, a random instance of CSP(P) with n variables and m constraints is unsatisfiable with high probability when m >= O(n). The natural algorithmic task in this regime is refutation: finding a proof that a given random instance is unsatisfiable. Recent work of Allen et al. suggests that the difficulty of refuting CSP(P) using an SDP is determined by a parameter cmplx(P), the smallest t for which there does not exist a t-wise uniform distribution over satisfying assignments to P. In particular they show that random instances of CSP(P) with m >> n^{cmplx(P)/2} can be refuted efficiently using an SDP. In this work, we give evidence that n^{cmplx(P)/2} constraints are also necessary for refutation using SDPs. Specifically, we show that if P supports a (t-1)-wise uniform distribution over satisfying assignments, then the Sherali-Adams_+ and Lovasz-Schrijver_+ SDP hierarchies cannot refute a random instance of CSP(P) in polynomial time for any m <= n^{t/2-epsilon}.
Keywords
  • constraint satisfaction problems
  • LP and SDP relaxations
  • average-case complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Sarah R. Allen, Ryan O'Donnell, and David Witmer. How to refute a random CSP. In Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science, pages 689-708, 2015. Google Scholar
  2. Benny Applebaum, Boaz Barak, and Avi Wigderson. Public-key cryptography from different assumptions. In Proceedings of the 42nd Annual ACM Symposium on Theory of Computing, pages 171-180, 2010. Google Scholar
  3. Boaz Barak. Lecture 1 - Introduction. Notes from course "Sum of Squares upper bounds, lower bounds, and open questions". Google Scholar
  4. Boaz Barak, Fernando G. S. L. Brandão, Aram W. Harrow, Jonathan Kelner, David Steurer, and Yuan Zhou. Hypercontractivity, Sum-of-Squares Proofs, and their Applications. In Proceedings of the 44th Annual ACM Symposium on Theory of Computing, pages 307-326, 2012. Google Scholar
  5. Boaz Barak, Siu On Chan, and Pravesh Kothari. Sum of squares lower bounds from pairwise independence. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing, pages 97-106, 2015. Google Scholar
  6. Boaz Barak, Guy Kindler, and David Steurer. On the Optimality of Semidefinite Relaxations for Average-Case and Generalized Constraint Satisfaction. In Proceedings of the 4th Innovations in Theoretical Computer Science conference, 2013. Google Scholar
  7. Boaz Barak and Ankur Moitra. Tensor Prediction, Rademacher Complexity and Random 3-XOR. CoRR, abs/1501.06521, 2015. URL: http://arxiv.org/abs/1501.06521.
  8. Eli Ben-Sasson and Yonatan Bilu. A gap in average proof complexity. Electronic Colloquium on Computational Complexity (ECCC), 9(3), 2002. Google Scholar
  9. Siavosh Benabbas, Konstantinos Georgiou, Avner Magen, and Madhur Tulsiani. SDP gaps from pairwise independence. Theory of Computing, 8:269-289, 2012. Google Scholar
  10. Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, and Toniann Pitassi. Rank bounds and integrality gaps for cutting planes procedures. Theory of Computing, 2:65-90, 2006. URL: http://dx.doi.org/10.4086/toc.2006.v002a004.
  11. Siu On Chan, James R. Lee, Prasad Raghavendra, and David Steurer. Approximate constraint satisfaction requires large LP relaxations. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, pages 350-359, 2013. Google Scholar
  12. Amin Coja-Oghlan, Andreas Goerdt, and André Lanka. Strong Refutation Heuristics for Random k-SAT. In Klaus Jansen, Sanjeev Khanna, José D.P. Rolim, and Dana Ron, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, volume 3122 of Lecture Notes in Computer Science, pages 310-321. Springer Berlin Heidelberg, 2004. URL: http://dx.doi.org/10.1007/978-3-540-27821-4_28.
  13. A Crisanti, L Leuzzi, and G Parisi. The 3-SAT problem with large number of clauses in the ∞-replica symmetry breaking scheme. Journal of Physics A: Mathematical and General, 35(3):481, 2002. Google Scholar
  14. Amit Daniely, Nati Linial, and Shai Shalev-Shwartz. From average case complexity to improper learning complexity. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pages 441-448, 2014. Google Scholar
  15. Sanjeeb Dash. On the Matrix Cuts of Lovász and Schrijver and their use in Integer Programming. PhD thesis, Rice University, 2001. Google Scholar
  16. Jian Ding, Allan Sly, and Nike Sun. Proof of the satisfiability conjecture for large k. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing, pages 59-68, 2015. Google Scholar
  17. Uriel Feige. Relations Between Average Case Complexity and Approximation Complexity. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 534-543, 2002. Google Scholar
  18. Uriel Feige and Eran Ofek. Easily refutable subformulas of large random 3CNF formulas. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming, volume 3142 of Lecture Notes in Comput. Sci., pages 519-530. Springer, Berlin, 2004. Google Scholar
  19. Vitaly Feldman, Will Perkins, and Santosh Vempala. On the Complexity of Random Satisfiability Problems with Planted Solutions. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing, pages 77-86, 2015. Google Scholar
  20. Joel Friedman, Andreas Goerdt, and Michael Krivelevich. Recognizing more unsatisfiable random k-SAT instances efficiently. SIAM J. Comput., 35(2):408-430, 2005. URL: http://dx.doi.org/10.1137/S009753970444096X.
  21. Dima Grigoriev. Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity. Theoretical Computer Science, 259(1-2):613-622, 2001. Google Scholar
  22. Dima Grigoriev, Edward A. Hirsch, and Dmitrii V. Pasechnik. Complexity of semi-algebraic proofs. In Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science, pages 419-430, 2002. Google Scholar
  23. Arist Kojevnikov and Dmitry Itsykson. Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, 2006. Google Scholar
  24. James R. Lee, Prasad Raghavendra, and David Steurer. Lower bounds on the size of semidefinite programming relaxations. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing, pages 567-576, 2015. Google Scholar
  25. László Lovász and Alexander Schrijver. Cones of Matrices and Set-Functions and 0-1 Optimization. SIAM Journal on Optimization, 1(2):166-190, 1991. Google Scholar
  26. Ryan O'Donnell and David Witmer. Goldreich’s PRG: Evidence for near-optimal polynomial stretch. In Proceedings of the 29th Annual Conference on Computational Complexity, pages 1-12, 2014. Google Scholar
  27. Prasad Raghavendra. Optimal Algorithms and Inapproximability Results for Every CSP? In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pages 245-254, 2008. Google Scholar
  28. Grant Schoenebeck. Linear Level Lasserre Lower Bounds for Certain k-CSPs. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, pages 593-602, 2008. Google Scholar
  29. Hanif Sherali and Warren Adams. A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems. SIAM Journal on Discrete Mathematics, 3(3):411-430, 1990. Google Scholar
  30. Madhur Tulsiani and Pratik Worah. LS_+ lower bounds from pairwise independence. In Proceedings of the 28th Annual Conference on Computational Complexity, pages 121-132, 2013. Google Scholar
  31. Martin J. Wainwright and Michael I. Jordan. Graphical Models, Exponential Families, and Variational Inference, volume 1. Now Publishers Inc., Hanover, MA, USA, January 2008. URL: http://dx.doi.org/10.1561/2200000001.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail