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
Truth-preservation under fuzzy pp-formulas
Pilar Dellunde,Amanda Vidal +1 more
TL;DR: In this article, the authors take a logical model-theoretic approach to the analysis of complexity in fuzzy constraint satisfaction, and present an algebraic characterization of classes axiomatized by this kind of sentences in terms of homomorphisms and direct products.
Journal ArticleDOI
Parameterized Counting of Partially Injective Homomorphisms
TL;DR: The abstract classification theorem is applied to the problem of counting locally injective graph homomorphisms from small pattern graphs to large target graphs and is able to fully classify its parameterized complexity depending on the class of allowed pattern graphs.
Book ChapterDOI
Complexity of Conjunctive Regular Path Query Homomorphisms
TL;DR: The complexity of deciding the existence of a homomorphism between two RGPs, a strong type of containment between two navigational RGP queries, is studied and it is shown that this problem can be solved by an EXPTIME algorithm.
Posted Content
CSAT and CEQV for nilpotent Maltsev algebras of Fitting length > 2.
TL;DR: In this paper, the complexity of the circuit equivalence problem for all nilpotent Maltsev algebras of Fitting Length > 2 was shown to be in polynomial time.
Posted Content
The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain
TL;DR: In this article, the complexity of the Ideal Membership Problem for combinatorial ideals arising from constrained problems over the Boolean domain is studied, and the authors identify the borderline of tractability.
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