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
The Complexity of the Distributed Constraint Satisfaction Problem
TL;DR: In this article , the authors studied the complexity of the distributed constraint satisfaction problem on a synchronous, anonymous network from a theoretical standpoint and showed that it is polynomial-time tractable under symmetric polymorphisms of all arities.
Proceedings ArticleDOI
On Classifying Continuous Constraint Satisfaction problems
TL;DR: In this article , a systematic study of continuous constraint satisfaction problems (CCSPs) is conducted, where the authors define the class of CCSPs that are complete of the Existential Theory of the Reals.
Book ChapterDOI
Algorithms and Complexity
TL;DR: A collection of theorems in algorithms and complexity, proved in the twenty-first century, which are at the same time great and easy to understand can be found in this paper.
Approximate Graph Colouring and the Crystal with a Hollow Shadow
Lorenzo Ciardo,Stanislav vZivn'y +1 more
TL;DR: In this paper , it was shown that approximate graph colouring is not solved by the lift-and-project hierarchy for the combination of linear programming and linear Diophantine equations.
Journal ArticleDOI
On a stronger reconstruction notion for monoids and clones
TL;DR: In this paper, a new reconstruction notion for permutation groups, transformation monoids and clones, called automatic action compatibility, was introduced, which entails automatic homeomorphicity, and was shown to be applicable to several countable structures, including the strictly ordered rationals, the directed and undirected version of the random graph, the random tournament and bipartite graph, and the generic strictly ordered set.
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