Kernelization of Constraint Satisfaction Problems: A Study Through Universal Algebra

A kernelization algorithm for a computational problem is a procedure which compresses an instance into an equivalent instance whose size is bounded with respect to a complexity parameter. For the constraint satisfaction problem (CSP), there exist many results concerning upper and lower bounds for kernelizability of specific problems, but it is safe to say that we lack general methods to determine whether a given problem admits a kernel of a particular size. In this paper, we take an algebraic approach to the problem of characterizing the kernelization limits of NP-hard CSP problems, parameterized by the number of variables. Our main focus is on problems admitting linear kernels, as has, somewhat surprisingly, previously been shown to exist. We show that a finite-domain CSP problem has a kernel with O(n) constraints if it can be embedded (via a domain extension) into a CSP which is preserved by a Maltsev operation. This result utilise a variant of the simple algorithm for Maltsev constraints. In the complementary direction, we give indication that the Maltsev condition might be a complete characterization for Boolean CSPs with linear kernels, by showing that an algebraic condition that is shared by all problems with a Maltsev embedding is also necessary for the existence of a linear kernel unless NP \(\subseteq \) co-NP/poly.

[1]  L. A. Kaluzhnin,et al.  Galois theory for post algebras. I , 1969 .

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

[3]  D. Lau,et al.  Function Algebras on Finite Sets: Basic Course on Many-Valued Logic and Clone Theory (Springer Monographs in Mathematics) , 2006 .

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

[5]  Dániel Marx,et al.  Constraint Satisfaction Parameterized by Solution Size , 2014, SIAM J. Comput..

[6]  Heribert Vollmer,et al.  Bases for Boolean co-clones , 2005, Inf. Process. Lett..

[7]  Magnus Wahlström,et al.  The power of primitive positive definitions with polynomially many variables , 2017, J. Log. Comput..

[8]  B. A. Romov.  The algebras of partial functions and their invariants , 1981 .

[9]  Bart M. P. Jansen,et al.  Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT , 2015, Algorithmica.

[10]  R. McKenzie,et al.  Varieties with few subalgebras of powers , 2009 .

[11]  Russell Impagliazzo,et al.  Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..

[12]  Peter Jeavons,et al.  Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..

[13]  Dániel Marx,et al.  On the Hardness of Losing Weight , 2008, ICALP.

[14]  Martin Goldstern,et al.  A survey of clones on infinite sets , 2006 .

[15]  Heribert Vollmer,et al.  Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help? , 2008, Complexity of Constraints.

[16]  Magnus Wahlström,et al.  Bounded Bases of Strong Partial Clones , 2015, 2015 IEEE International Symposium on Multiple-Valued Logic.

[17]  Martin E. Dyer,et al.  An Effective Dichotomy for the Counting Constraint Satisfaction Problem , 2010, SIAM J. Comput..

[18]  Pawel M. Idziak,et al.  Tractability and Learnability Arising from Algebras with Few Subpowers , 2010, SIAM J. Comput..

[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]  Dániel Marx.  Parameterized complexity of constraint satisfaction problems , 2004 .

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

[22]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[23]  Dieter van Melkebeek,et al.  Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses , 2010, STOC '10.

[24]  Tomás Feder,et al.  Dichotomy for Digraph Homomorphism Problems , 2017, ArXiv.

[25]  Stefan Kratsch,et al.  Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems , 2010, TOCT.

[26]  Bart M. P. Jansen,et al.  Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT , 2016, Algorithmica.

[27]  Andrei A. Bulatov,et al.  A Simple Algorithm for Mal'tsev Constraints , 2006, SIAM J. Comput..

[28]  Bart M. P. Jansen,et al.  Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials , 2016, MFCS.

[29]  Russell Impagliazzo,et al.  Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[30]  Marc Gyssens,et al.  A Unifying Framework for Tractable Constraints , 1995, CP.

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

[32]  Gustav Nordh,et al.  Strong partial clones and the time complexity of SAT problems , 2017, J. Comput. Syst. Sci..

[33]  Libor Barto,et al.  Constraint satisfaction problem and universal algebra , 2014, SIGL.

[34]  Graham Wrightson,et al.  Automation of reasoning--classical papers on computational logic , 2012 .

[35]  D. Geiger.  CLOSED SYSTEMS OF FUNCTIONS AND PREDICATES , 1968 .

[36]  Stefan Kratsch,et al.  Preprocessing of Min Ones Problems: A Dichotomy , 2010, ICALP.

[37]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[38]  Peter Jeavons,et al.  Learnability of Quantified Formulas , 1999, EuroCOLT.