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
Parameterized Complexity Classification for Interval Constraints
Konrad K. Dabrowski,Peter Jonsson,Sebastian Ordyniak,George Osipov,Marcin Pilipczuk,Roohani Sharma +5 more
TL;DR: In this article , an FPT vs. W[1]-hard dichotomy for MinCSP$(A)$ for all ε-subseteq A is presented, where ε is the number of unsatisfied constraints.
Journal ArticleDOI
When do homomorphism counts help in query algorithms?
TL;DR: The main result of as discussed by the authors is that if a property is closed under homomorphic equivalence, then that property admits a left query algorithm over B if and only if it admits a right query over N.
Posted Content
Quantaloidal approach to constraint satisfaction.
TL;DR: In this article, it was shown that the constraint satisfaction problem can be formulated abstractly inside the 2-category FinSet of finite sets and sets of functions between them, and that a class of optimisation problems can be classified by the associated notion of polymorphism.
Peer Review
Measurable graph combinatorics
TL;DR: A survey of recent results in the theory of measurable graph combinatorics can be found in this paper , where the authors also discuss applications to the study of hyperfiniteness and measurable equidecompositions.
Book ChapterDOI
Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs
TL;DR: The CSP dichotomy conjecture has been recently established, but a number of other dichotomy questions remain open, including the dichotomy classification of list homomorphism problems for signed graphs as mentioned 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