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
Hardness of Network Satisfaction for Relation Algebras with Normal Representations
Manuel Bodirsky,Simon Knäuer +1 more
TL;DR: In this article, the authors studied the computational complexity of the general network satisfaction problem for finite relation algebras with a normal representation and proved that the problem is NP-hard.
Journal ArticleDOI
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns
TL;DR: This work identifies five new patterns whose absence ensures solvability by singleton arc consistency, four of which are provably maximal and three of which generalise 2-SAT.
Proceedings ArticleDOI
The Complexity of Boolean Surjective General-Valued CSPs
Peter Fulla,Stanislav Zivny +1 more
TL;DR: A dichotomy theorem is established and thus a complete complexity classification of Boolean surjective VCSPs with respect to exact solvability is given and a novel tractable class of languages is identified that is trivial in the non-surjective setting.
Proceedings Article
On the Strength of Uniqueness Quantification in Primitive Positive Formulas.
Victor Lagerkvist,Gustav Nordh +1 more
TL;DR: In this article, the authors investigated the strength of uniqueness quantification when it is used in place of existential quantification in conjunctive formulas over a given set of relations, so-called primitive positive definitions (pp-definitions).
Journal ArticleDOI
Point-Width and Max-CSPs
TL;DR: The complexity of (unbounded-arity) Max-CSPs under structural restrictions is poorly understood and the two most general hypergraph properties known to ensure tractability of Max- CSPs, β-acyclicity an...
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