Abstract
It has been shown that for a general-valued constraint language Γ the following statements are equivalent: (1) any instance of VCSP(Γ) can be solved to optimality using a constant level of the Sherali-Adams LP hierarchy, (2) any instance of VCSP(Γ) can be solved to optimality using the third level of the Sherali-Adams LP hierarchy, and (3) the support of Γ satisfies the “bounded width condition” (i.e., it contains weak near-unanimity operations of all arities).
We show that if the support of Γ violates the bounded width condition then not only is VCSP(Γ) not solved by a constant level of the Sherali-Adams LP hierarchy, but it also requires linear levels of the Lasserre SDP hierarchy (also known as the sum-of-squares SDP hierarchy). For Γ corresponding to linear equations in an Abelian group, this result follows from existing work on inapproximability of Max-CSPs. By a breakthrough result of Lee, Raghavendra, and Steurer [STOC’15], our result implies that for any Γ whose support violates the bounded width condition no SDP relaxation of polynomial size solves VCSP(Γ).
We establish our result by proving that various reductions preserve exact solvability by the Lasserre SDP hierarchy (up to a constant factor in the level of the hierarchy). Our results hold for general-valued constraint languages (i.e., sets of functions on a fixed finite domain that take on rational or infinite values) and thus also hold in notable special cases of { 0, ∞ }-valued languages (CSPs), {0, 1}-valued languages (Min-CSPs/Max-CSPs), and Q-valued languages (finite-valued CSPs).
- Sanjeev Arora, Satish Rao, and Umesh V. Vazirani. 2009. Expander flows, geometric embeddings and graph partitioning. Journal of the ACM 56, 2 (2009), Article 5. Google Scholar
Digital Library
- Albert Atserias, Andrei Bulatov, and Anuj Dawar. 2009. Affine systems of equations and counting infinitary logic. Theoretical Computer Science 410, 18 (2009), 1666--1683. Google Scholar
Digital Library
- Albert Atserias and Joanna Ochremiak. 2017. Proof complexity meets algebra. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP’17). 110:1--110:14.Google Scholar
- Libor Barto and Marcin Kozik. 2014. Constraint satisfaction problems solvable by local consistency methods. Journal of the ACM 61, 1 (2014), Article 3. Article No. 3 Google Scholar
Digital Library
- Libor Barto and Marcin Kozik. 2016. Robustly solvable constraint satisfaction problems. SIAM Journal on Computing 45, 4 (2016), 1646--1669.Google Scholar
Cross Ref
- Libor Barto, Marcin Kozik, and Todd Niven. 2009. The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell). SIAM Journal on Computing 38, 5 (2009), 1782--1802. Google Scholar
Digital Library
- Manuel Bodirsky. 2008. Constraint satisfaction problems with infinite templates. In Complexity of Constraints. Lecture Notes in Computer Science, Vol. 5250. Springer, 196--228.Google Scholar
- Andrei Bulatov. 2006. A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the ACM 53, 1 (2006), 66--120. Google Scholar
Digital Library
- Andrei Bulatov. 2017. A dichotomy theorem for nonuniform CSP. In Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS’17). IEEE, Los Alamitos, CA, 319--330.Google Scholar
Cross Ref
- Andrei Bulatov, Peter Jeavons, and Andrei Krokhin. 2005. Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34, 3 (2005), 720--742. Google Scholar
Digital Library
- Andrei A. Bulatov. 2011. Complexity of conservative constraint satisfaction problems. ACM Transactions on Computational Logic 12, 4 (2011), Article 24. Article 24 Google Scholar
Digital Library
- Andrei A. Bulatov. 2016. Graphs of relational structures: Restricted types. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS’16). ACM, New York, NY, 642--651. Google Scholar
Digital Library
- Siu On Chan. 2016. Approximation resistance from pairwise-independent subgroups. Journal of the ACM 63, 3 (2016), Article 27. Google Scholar
Digital Library
- Siu On Chan, James R. Lee, Prasad Raghavendra, and David Steurer. 2016. Approximate constraint satisfaction requires large LP relaxations. Journal of the ACM 63, 4 (2016), 34:1--34:22. Google Scholar
Digital Library
- Moses Charikar, Konstantin Makarychev, and Yury Makarychev. 2009. Integrality gaps for Sherali-Adams relaxations. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC’09). ACM, New York, NY, 283--292. Google Scholar
Digital Library
- Eden Chlamtáč and Madhur Tulsiani. 2012. Convex relaxations and integrality gaps. In Handbook on Semidefinite, Conic and Polynomial Optimization, M. F. Anjos and J. B. Lasserre (Eds.). International Series in Operations Research and Management Science, Vol. 166. Springer, 139--169.Google Scholar
- David A. Cohen, Martin C. Cooper, Páidí Creed, Peter Jeavons, and Stanislav Živný. 2013. An algebraic theory of complexity for discrete optimisation. SIAM Journal on Computing 42, 5 (2013), 915--1939.Google Scholar
Cross Ref
- Víctor Dalmau and Andrei A. Krokhin. 2013. Robust satisfiability for CSPs: Hardness and algorithmic results. ACM Transactions on Computation Theory 5, 4 (2013), Article 15. Google Scholar
Digital Library
- Anuj Dawar and Pengming Wang. 2017. Lasserre lower bounds and definability of semidefinite programming for CSPs. In Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS’17). ACM, New York, NY, 1--12.Google Scholar
Cross Ref
- Tomás Feder and Moshe Y. Vardi. 1998. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM Journal on Comput. 28, 1 (1998), 57--104. Google Scholar
Digital Library
- Bernd Gärtner and Jiří Matoušek. 2012. Approximation Algorithms and Semidefinite Programming. Springer Science 8 Business Media. Google Scholar
Digital Library
- Mrinal Kanti Ghosh and Madhur Tulsiani. 2017. From weak to strong LP gaps for all CSPs. In Proceedings of the 32nd Annual IEEE Conference on Computational Complexity (CCC’17).Google Scholar
- Michel X. Goemans and David P. Williamson. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42, 6 (1995), 1115--1145. Google Scholar
Digital Library
- Dima Grigoriev. 2001. Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity. Theoretical Computer Science 259, 1--2 (2001), 613--622.Google Scholar
Cross Ref
- Venkatesan Guruswami and Yuan Zhou. 2012. Tight bounds on the approximability of almost-satisfiable horn SAT and exact hitting set. Theory of Computing 8, 1 (2012), 239--267.Google Scholar
Cross Ref
- Johan Håstad. 2001. Some optimal inapproximability results. Journal of the ACM 48, 4 (2001), 798--859. Google Scholar
Digital Library
- Pavol Hell and Jaroslav Nešetřil. 1990. On the complexity of -coloring. Journal of Combinatorial Theory, Series B 48, 1 (1990), 92--110. Google Scholar
Digital Library
- Pavol Hell and Jaroslav Nešetřil. 2008. Colouring, constraint satisfaction, and complexity. Computer Science Review 2, 3 (2008), 143--163. Google Scholar
Digital Library
- Peter Jeavons, David A. Cohen, and Marc Gyssens. 1997. Closure properties of constraints. Journal of the ACM 44, 4 (1997), 527--548. Google Scholar
Digital Library
- David R. Karger, Rajeev Motwani, and Madhu Sudan. 1998. Approximate graph coloring by semidefinite programming. Journal of the ACM 45, 2 (1998), 246--265. Google Scholar
Digital Library
- Vladimir Kolmogorov, Andrei A. Krokhin, and Michal Rolínek. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing 46, 3 (2017), 1087--1110.Google Scholar
Digital Library
- Vladimir Kolmogorov, Johan Thapper, and Stanislav Živný. 2015. The power of linear programming for general-valued CSPs. SIAM Journal on Computing 44, 1 (2015), 1--36. Google Scholar
Digital Library
- Pravesh K. Kothari, Raghu Meka, and Prasad Raghavendra. 2017. Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC’17). 590--603. Google Scholar
Digital Library
- Marcin Kozik, Andrei Krokhin, Matt Valeriote, and Ross Willard. 2015. Characterizations of several Maltsev conditions. Algebra Universalis 73, 3--4 (2015), 205--224.Google Scholar
Cross Ref
- Marcin Kozik and Joanna Ochremiak. 2015. Algebraic properties of valued constraint satisfaction problem. In Automata, Languages, and Programming. Lecture Notes in Computer Science, Vol. 9134. Springer, 846--858.Google Scholar
- Gábor Kun, Ryan O’Donnell, Suguru Tamaki, Yuichi Yoshida, and Yuan Zhou. 2012. Linear programming, width-1 CSPs, and robust satisfaction. In Proceedings of 3rd Innovations in Theoretical Computer Science (ITCS’12). ACM, New York, NY, 484--495. Google Scholar
Digital Library
- Benoit Larose and Lázló Zádori. 2007. Bounded width problems and algebras. Algebra Universalis 56, 3--4 (2007), 439--466.Google Scholar
Cross Ref
- Jean B. Lasserre. 2001. Global optimization with polynomials and the problem of moments. SIAM Journal on Optimization 11, 3 (2001), 796--817. Google Scholar
Digital Library
- Jean B. Lasserre. 2002. An explicit equivalent positive semidefinite program for nonlinear 0-1 programs. SIAM Journal on Optimization 12, 3 (2002), 756--769. Google Scholar
Digital Library
- Monique Laurent. 2003. A comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre relaxations for 0-1 programming. Mathematics of Operations Research 28, 3 (2003), 470--496. Google Scholar
Digital Library
- James R. Lee, Prasad Raghavendra, and David Steurer. 2014. Lower bounds on the size of semidefinite programming relaxations. arXiv:1411.6317. http://arxiv.org/abs/1411.6317Google Scholar
- James R. Lee, Prasad Raghavendra, and David Steurer. 2015. Lower bounds on the size of semidefinite programming relaxations. In Proceedings of the 47th Symposium on Theory of Computing (STOC’15). 567--576. Google Scholar
Digital Library
- László Lovász and Alexander Schrijver. 1991. Cones of matrices and set-functions and 0-1 optimization. SIAM Journal on Optimization 1, 2 (1991), 166--190.Google Scholar
Cross Ref
- Miklós Maróti and Ralph McKenzie. 2008. Existence theorems for weakly symmetric operations. Algebra Universalis 59, 3--4 (2008), 463--489.Google Scholar
Cross Ref
- Ryan O’Donnell and Yuan Zhou. 2013. Approximability and proof complexity. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’13). 1537--1556. Google Scholar
Digital Library
- Prasad Raghavendra and David Steurer. 2017. Personal communication.Google Scholar
- Thomas J. Schaefer. 1978. The complexity of satisfiability problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC’78). ACM, New York, NY, 216--226. Google Scholar
Digital Library
- Grant Schoenebeck. 2008. Linear level Lasserre lower bounds for certain k-CSPs. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS’08). IEEE, Los Alamitos, CA, 593--602. Google Scholar
Digital Library
- H. D. Sherali and W. P. Adams. 1990. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal of Discrete Mathematics 3, 3 (1990), 411--430. Google Scholar
Digital Library
- Johan Thapper and Stanislav Živný. 2016. The complexity of finite-valued CSPs. Journal of the ACM 63, 4 (2016), Article 37. Google Scholar
Digital Library
- Johan Thapper and Stanislav Živný. 2017. The power of Sherali-Adams relaxations for general-valued CSPs. SIAM Journal on Computing 46, 4 (2017), 1241--1279.Google Scholar
Cross Ref
- Johan Thapper and Stanislav Živný. 2017. The limits of SDP relaxations for general-valued CSPs. In Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS’17). ACM, New York, NY, 1--12.Google Scholar
Cross Ref
- Madhur Tulsiani. 2009. CSP gaps and reductions in the Lasserre hierarchy. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC’09). ACM, New York, NY, 303--312. Google Scholar
Digital Library
- Lieven Vandenberghe and Stephen P. Boyd. 1996. Semidefinite programming. SIAM Review 38, 1 (1996), 49--95. Google Scholar
Digital Library
- Vijay V. Vazirani. 2013. Approximation Algorithms. Springer Science 8 Business Media.Google Scholar
Digital Library
- David P. Williamson and David B. Shmoys. 2011. The Design of Approximation Algorithms. Cambridge University Press. Google Scholar
Digital Library
- Mihalis Yannakakis. 1991. Expressing combinatorial optimization problems by linear programs. Journal on Computer System Science 43, 3 (1991), 441--466.Google Scholar
Cross Ref
- Dmitriy Zhuk. 2017. The proof of CSP dichotomy conjecture. In Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS’17). IEEE, Los Alamitos, CA, 331--342.Google Scholar
Cross Ref
Index Terms
The Limits of SDP Relaxations for General-Valued CSPs
Recommendations
The Complexity of Finite-Valued CSPs
We study the computational complexity of exact minimization of rational-valued discrete functions. Let Γ be a set of rational-valued functions on a fixed finite domain; such a set is called a finite-valued constraint language. The valued constraint ...
The limits of SDP relaxations for general-valued CSPs
LICS '17: Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer ScienceIt has been shown that for a general-valued constraint language Γ the following statements are equivalent: (1) any instance of VCSP(Γ) can be solved to optimality using a constant level of the Sherali-Adams LP hierarchy; (2) any instance of VCSP(Γ) can ...
The complexity of finite-valued CSPs
STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of ComputingLet Γ be a set of rational-valued functions on a fixed finite domain; such a set is called a finite-valued constraint language. The valued constraint satisfaction problem, VCSP(Γ), is the problem of minimising a function given as a sum of functions from ...






Comments