The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain

Given an ideal I and a polynomial f the Ideal Membership Problem (IMP) is to test if f ϵ I. This problem is a fundamental algorithmic problem with important applications and notoriously intractable. We study the complexity of the IMP for combinatorial ideals that arise from constrained problems over the Boolean domain. As our main result, we identify the borderline of tractability. By using Gröbner bases techniques, we extend Schaefer’s dichotomy theorem [STOC, 1978] which classifies all Constraint Satisfaction Problems (CSPs) over the Boolean domain to be either in P or NP-hard. Moreover, our result implies necessary and sufficient conditions for the efficient computation of Theta Body Semi-Definite Programming (SDP) relaxations, identifying therefore the borderline of tractability for constraint language problems. This article is motivated by the pursuit of understanding the recently raised issue of bit complexity of Sum-of-Squares (SoS) proofs [O’Donnell, ITCS, 2017]. Raghavendra and Weitz [ICALP, 2017] show how the IMP tractability for combinatorial ideals implies bounded coefficients in SoS proofs.

[1]  Dmitriy Zhuk,et al.  A Proof of CSP Dichotomy Conjecture , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[2]  Rekha R. Thomas,et al.  Theta Bodies for Polynomial Ideals , 2008, SIAM J. Optim..

[3]  Prasad Raghavendra,et al.  On the Bit Complexity of Sum-of-Squares Proofs , 2017, ICALP.

[4]  Jan Krajícek,et al.  Lower bounds on Hilbert's Nullstellensatz and propositional proofs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[5]  Monaldo Mastrolilli,et al.  Ideal Membership Problem for Boolean Minority and Dual Discriminator , 2021, MFCS.

[6]  Peter Jeavons,et al.  Representing and solving finite-domain constraint problems using systems of polynomials , 2013, Annals of Mathematics and Artificial Intelligence.

[7]  Alicia Dickenstein,et al.  The membership problem for unmixed polynomial ideals is solvable in single exponential time , 1991, Discret. Appl. Math..

[8]  A. Bulatov,et al.  On the complexity of CSP-based ideal membership problems , 2020, STOC.

[9]  Ryan O'Donnell,et al.  SOS Is Not Obviously Automatizable, Even Approximately , 2016, ITCS.

[10]  Andrei A. Krokhin,et al.  The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231) , 2018, Dagstuhl Reports.

[11]  Emil L. Post.  The two-valued iterative systems of mathematical logic , 1942 .

[12]  Ernst W. Mayr,et al.  Membership in Plynomial Ideals over Q Is Exponential Space Complete , 1989, STACS.

[13]  Grete Hermann,et al.  Die Frage der endlich vielen Schritte in der Theorie der Polynomideale , 1926 .

[14]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[15]  D. Hilbert,et al.  Ueber die vollen Invariantensysteme , 1893 .

[16]  D. Hilbert.  Ueber die vollen Invariantensysteme , .

[17]  Benjamin Weitz,et al.  Polynomial Proof Systems, Effective Derivations, and their Applications in the Sum-of-Squares Hierarchy , 2017 .

[18]  E. Mayr,et al.  Complexity of Membership Problems of Different Types of Polynomial Ideals , 2017 .

[19]  Andrei A. Bulatov,et al.  A Dichotomy Theorem for Nonuniform CSPs , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[20]  Peter Jeavons,et al.  On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..

[21]  Russell Impagliazzo,et al.  Using the Groebner basis algorithm to find proofs of unsatisfiability , 1996, STOC '96.

[22]  Dima Grigoriev,et al.  Tseitin's tautologies and lower bounds for Nullstellensatz proofs , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[23]  Hubie Chen,et al.  A rendezvous of logic, complexity, and algebra , 2009, CSUR.

[24]  Marc Gyssens,et al.  Closure properties of constraints , 1997, JACM.

[25]  Samuel R. Buss,et al.  Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle , 1998, J. Comput. Syst. Sci..

[26]  Monaldo Mastrolilli,et al.  Ideal Membership Problem and a Majority Polymorphism over the Ternary Domain , 2020, MFCS.

[27]  Samuel R. Buss,et al.  Good degree bounds on Nullstellensatz refutations of the induction principle , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[28]  Bruno Buchberger,et al.  Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal , 2006, J. Symb. Comput..

[29]  A. Meyer,et al.  The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[30]  David A. Cox,et al.  Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics) , 2007 .

[31]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.