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
Book ChapterDOI
Galois Connections for Patterns: An Algebra of Labelled Graphs.
TL;DR: In this paper, a Galois connection between lattices composed of sets of forbidden patterns and sets of generic instances is established, and the power of forbidding augmented patterns and their potential for describing new tractable classes is discussed.
Book ChapterDOI
Quantified Valued Constraint Satisfaction Problem
TL;DR: This work studies the complexity of the quantified and valued extension of the constraint satisfaction problem (QVCSP) for certain classes of languages with min-max quantifiers.
Posted Content
Constraint Satisfaction Problems over Finite Structures
TL;DR: In this article, the authors studied the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations, and showed the close connection between this problem and a natural algebraic question: which finite algebras admit only polynomially many homomorphisms into them?
Journal ArticleDOI
Maximal Digraphs with Respect to Primitive Positive Constructability
TL;DR: In this paper , the authors studied the class of all finite directed graphs up to primitive positive constructibility and showed that every digraph that is not equivalent to P1 and P2 is below one of the submaximal digraphs.
Journal ArticleDOI
On guarded extensions of MMSNP
A. Barsukov,Florent Madelaine +1 more
TL;DR: In this paper , the authors investigate logics and classes of problems below Fagin's existential second-order logic (ESO) and above Feder and Vardi's logic for constraint satisfaction problems (CSP), the so called monotone monadic SNP without inequality (MMSNP), and explore the area between these four logics, mostly by considering guarded extensions of MMSNP.
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