Best-Case and Worst-Case Sparsifiability of Boolean CSPs

Abstract

We continue the investigation of polynomial-time sparsification for NP-complete Boolean Constraint Satisfaction Problems (CSPs). The goal in sparsification is to reduce the number of constraints in a problem instance without changing the answer, such that a bound on the number of resulting constraints can be given in terms of the number of variables n. We investigate how the worst-case sparsification size depends on the types of constraints allowed in the problem formulation (the constraint language). Two algorithmic results are presented. The first result essentially shows that for any arity k, the only constraint type for which no nontrivial sparsification is possible has exactly one falsifying assignment, and corresponds to logical OR (up to negations). Our second result concerns linear sparsification, that is, a reduction to an equivalent instance with O(n) constraints. Using linear algebra over rings of integers modulo prime powers, we give an elegant necessary and sufficient condition for a constraint type to be captured by a degree-1 polynomial over such a ring, which yields linear sparsifications. The combination of these algorithmic results allows us to prove two characterizations that capture the optimal sparsification sizes for a range of Boolean CSPs. For NP-complete Boolean CSPs whose constraints are symmetric (the satisfaction depends only on the number of 1 values in the assignment, not on their positions), we give a complete characterization of which constraint languages allow for a linear sparsification. For Boolean CSPs in which every constraint has arity at most three, we characterize the optimal size of sparsifications in terms of the largest OR that can be expressed by the constraint language. ACM Subject ClassificationComputing methodologies → Symbolic and algebraic algorithms, Theory of computation → Problems, reductions and completeness, Theory of computation → Parameterized complexity and exact algorithms

Sparsification of SAT and CSP Problems via Tractable Extensions

“…This method also solves the more difficult problem of finding a polynomialsized basis, i.e., given an instance I = (V, C) of CSP(Γ) on |V | = n variables and with constraint set C, we compute a set C ⊆ C with |C | = O(n c ) such that every assignment satisfying C also satisfies every constraint in C. Our results generalize and extend the kernelization results of Jansen and Pieterse [24]. (Recently, these results were further sharpened; see Chen et al [11]. )…”

“…In this section we study two generalizations which provide kernels with O(n c ) constraints for c > 1 3. Recently, Chen et al have shown that any Boolean language with a Maltsev extension over a group as above, also admits a Maltsev extension as equations over integer rings[11]. However, the general question of whether Maltsev extensions have greater expressive power than standard linear equations remains unanswered.…”

Sparsification Lower Bound for Linear Spanners in Directed Graphs

“…The notion is fruitful in theoretical [19] and practical [20] settings. The growing list of problems for which the existence of non-trivial sparsification algorithms has been ruled out under the same assumption includes Vertex Cover [21], Dominating Set [22], Feedback Arc Set [22], Treewidth [23], List H-Coloring [24], and Boolean Constraint Satisfaction problems [25].…”

Sparsification of Binary CSPs

“…We remark that the term "sparsification" is also used in an unrelated line of work in which the goal is, given a CSP instance, to reduce the number of constraints without changing satisfiability of the instance; see, e.g., [7].…”