Promise Constraint Satisfaction and Width

by   Albert Atserias, et al.

We study the power of the bounded-width consistency algorithm in the context of the fixed-template Promise Constraint Satisfaction Problem (PCSP). Our main technical finding is that the template of every PCSP that is solvable in bounded width satisfies a certain structural condition implying that its algebraic closure-properties include weak near unanimity polymorphisms of all large arities. While this parallels the standard (non-promise) CSP theory, the method of proof is quite different and applies even to the regime of sublinear width. We also show that, in contrast with the CSP world, the presence of weak near unanimity polymorphisms of all large arities does not guarantee solvability in bounded width. The separating example is even solvable in the second level of the Sherali-Adams (SA) hierarchy of linear programming relaxations. This shows that, unlike for CSPs, linear programming can be stronger than bounded width. A direct application of these methods also show that the problem of q-coloring p-colorable graphs is not solvable in bounded or even sublinear width, for any two constants p and q such that 3 ≤ p ≤ q. Turning to algorithms, we note that Wigderson's algorithm for O(√(n))-coloring 3-colorable graphs with n vertices is implementable in width 4. Indeed, by generalizing the method we see that, for any ϵ > 0 smaller than 1/2, the optimal width for solving the problem of O(n^ϵ)-coloring 3-colorable graphs with n vertices lies between n^1-3ϵ and n^1-2ϵ. The upper bound gives a simple 2^Θ(n^1-2ϵlog(n))-time algorithm that, asymptotically, beats the straightforward 2^Θ(n^1-ϵ) bound that follows from partitioning the graph into O(n^ϵ) many independent parts each of size O(n^1-ϵ).


page 1

page 2

page 3

page 4


Weisfeiler-Leman Invariant Promise Valued CSPs

In a recent line of work, Butti and Dalmau have shown that a fixed-templ...

Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width

Solving the algebraic dichotomy conjecture for constraint satisfaction p...

Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps

What makes a computational problem easy (e.g., in P, that is, solvable i...

Constraint Solving via Fractional Edge Covers

Many important combinatorial problems can be modeled as constraint satis...

Proof Complexity Meets Algebra

We analyse how the standard reductions between constraint satisfaction p...

Component twin-width as a parameter for BINARY-CSP and its semiring generalisations

We investigate the fine-grained and the parameterized complexity of seve...

An Algorithmic Blend of LPs and Ring Equations for Promise CSPs

Promise CSPs are a relaxation of constraint satisfaction problems where ...

Please sign up or login with your details

Forgot password? Click here to reset