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
Posted Content
The complete classification for quantified equality constraints.
Dmitriy Zhuk,Barnaby Martin +1 more
TL;DR: The complexity classification for quantified equality languages as a trichotomy between Logspace, NP-complete and PSpace-complete has been shown in this paper, concluding a question open for more than ten years.
Posted Content
Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation
TL;DR: This work begins the systematic investigation of the complexity of infinite-domain VCSPs with piecewise linear homogeneous cost functions and shows that submodular PLH functions form a maximally tractable class of PLH cost functions.
Journal ArticleDOI
Local consistency as a reduction between constraint satisfaction problems
Víctor Dalmau,Jakub Opršal +1 more
TL;DR: In this paper , the use of local consistency methods as reductions between constraint satisfaction problems (CSPs) and the promise version thereof was studied, with the aim of classifying these reductions in similar way as the algebraic approach classi es gadget reductions between CSPs.
Proceedings ArticleDOI
Point-width and Max-CSPs
TL;DR: The framework of point decompositions for hypergraphs is introduced and a new sufficient condition for the tractability of (structurally restricted) Max-CSPs is derived, which generalises both bounded MIM-width and $\beta$ -acyclicity.
Posted Content
Finite Relation Algebras with Normal Representations
TL;DR: In this article, the authors translate the recent findings into the traditional relation algebra setting, and point out a series of open problems at the interface between model theory and the theory of relation algebras.
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