Symmetric Polymorphisms and Efficient Decidability of Promise CSPs

07/09/2019
by   Joshua Brakensiek, et al.
0

In the field of constraint satisfaction problems (CSP), promise CSPs are an exciting new direction of study. In a promise CSP, each constraint comes in two forms: "strict" and "weak," and in the associated decision problem one must distinguish between being able to satisfy all the strict constraints versus not being able to satisfy all the weak constraints. The most commonly cited example of a promise CSP is the approximate graph coloring problem–which has recently benefited from multiple breakthroughs [BKO19, WZ19] due to a systematic study of promise CSPs under the lens of "polymorphisms," operations that map tuples in the strict form of each constraint to a tuple in its weak form. In this work, we present a simple algorithm which in polynomial time solves the decision problem for all promise CSPs that admit infinitely many symmetric polymorphisms, that is the coordinates are permutation invariant. This generalizes previous work of the authors [BG19]. We also extend this algorithm to a more general class of block-symmetric polymorphisms. As a corollary, this single algorithm solves all polynomial-time tractable Boolean CSPs simultaneously. These results give a new perspective on Schaefer's classic theorem and shed further light on how symmetries of polymorphisms enable algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/26/2021

Beyond PCSP(1-in-3,NAE)

The promise constraint satisfaction problem (PCSP) is a recently introdu...
research
10/09/2020

Finitely Tractable Promise Constraint Satisfaction Problems

The Promise Constraint Satisfaction Problem (PCSP) is a generalization o...
research
10/09/2020

Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case

The Promise Constraint Satisfaction Problem (PCSP) is a recently introdu...
research
07/13/2018

An Algorithmic Blend of LPs and Ring Equations for Promise CSPs

Promise CSPs are a relaxation of constraint satisfaction problems where ...
research
08/29/2022

An invitation to the promise constraint satisfaction problem

The study of the complexity of the constraint satisfaction problem (CSP)...
research
07/11/2021

CLAP: A New Algorithm for Promise CSPs

We propose a new algorithm for Promise Constraint Satisfaction Problems ...
research
03/15/2021

Promise Problems Meet Pseudodeterminism

The Acceptance Probability Estimation Problem (APEP) is to additively ap...

Please sign up or login with your details

Forgot password? Click here to reset