A Dichotomy Theorem for Nonuniform CSPs
Andrei A. Bulatov
- pp 319-330
Reads0
Chats0
TLDR
In this paper, the authors confirm the Dichotomy Conjecture for the non-uniform CSP, which states that for every constraint language \Gm the problem is either solvable in polynomial time or is NP-complete.Abstract:
In a non-uniform Constraint Satisfaction problem CSP(Γ), where G is a set of relations on a finite set A, the goal is to find an assignment of values to variables subject to constraints imposed on specified sets of variables using the relations from Γ. The Dichotomy Conjecture for the non-uniform CSP states that for every constraint language \Gm the problem CSP(Γ) is either solvable in polynomial time or is NP-complete. It was proposed by Feder and Vardi in their seminal 1993 paper. In this paper we confirm the Dichotomy Conjecture.read more
Citations
More filters
Journal ArticleDOI
Linear satisfiability preserving assignments
Kei Kimura,Kazuhisa Makino +1 more
TL;DR: A pseudo-polynomial time algorithm is presented that computes a linear fixable assignment for a given integer linear system, which implies the well known pseudo- polynomial solvability for integer linear systems such as two-variable-per-inequality (TVPI), Horn and q-Horn systems.
Posted Content
On Regularity of Max-CSPs and Min-CSPs.
TL;DR: It is shown that up to arbitrarily small error it is sufficient to conduct the study of approximability of CSPs only on regular unweighted instances.
Journal ArticleDOI
QCSP Monsters and the Demise of the Chen Conjecture
Dmitriy Zhuk,Barnaby Martin +1 more
TL;DR: A surprising classification for the computational complexity of the Quantified Constraint Satisfaction Problem over a constraint language Γ, QCSP, where Γ is a finite language over 3 elements which contains all constants refutes the hitherto widely-believed Chen Conjecture.
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems
TL;DR: In this article, the complexity of graph modification problems for homomorphism-based properties of edge-coloured graphs was studied, where vertex deletion, edge-deletion and switching are considered.
Journal ArticleDOI
Constant-Query Testability of Assignments to Constraint Satisfaction Problems
TL;DR: The resulting family of problems of CSP instances whose constraint relations are taken from A has been considered heavily and is considered heavily in this paper.
References
More filters
Proceedings ArticleDOI
The complexity of satisfiability problems
TL;DR: An infinite class of satisfiability problems is considered which contains these two particular problems as special cases, and it is shown that every member of this class is either polynomial-time decidable or NP-complete.
Journal ArticleDOI
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
Tomás Feder,Moshe Y. Vardi +1 more
TL;DR: This paper isolates a class (of problems specified by) "monotone monadic SNP without inequality" which may exhibit a dichotomy, and explains the placing of all these restrictions by showing, essentially using Ladner's theorem, that classes obtained by using only two of the above three restrictions do not show this dichotomy.
Journal ArticleDOI
On the complexity of H -coloring
Pavol Hell,Jaroslav Nešetřil +1 more
TL;DR: The natural conjecture, formulated in several sources, asserts that the H-coloring problem is NP-complete for any non-bipartite graph H, and a proof of this conjecture is given.
Journal ArticleDOI
Classifying the Complexity of Constraints Using Finite Algebras
TL;DR: It is shown that any set of relations used to specify the allowed forms of constraints can be associated with a finite universal algebra and how the computational complexity of the corresponding constraint satisfaction problem is connected to the properties of this algebra is explored.
Journal ArticleDOI
Undirected connectivity in log-space
TL;DR: A deterministic, log-space algorithm that solves st-connectivity in undirected graphs and implies a way to construct in log- space a fixed sequence of directions that guides a deterministic walk through all of the vertices of any connected graph.
Related Papers (5)
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
Tomás Feder,Moshe Y. Vardi +1 more