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
CC-circuits and the expressive power of nilpotent algebras
TL;DR: In this article , it was shown that CC-circuits of bounded depth have the same expressive power as circuits over finite nilpotent algebras from congruence modular varieties.
Proceedings ArticleDOI
CSP Beyond Tractable Constraint Languages
TL;DR: It is shown that for any finite, tractable, semi-conservative constraint language Γ, the CSP is fixed-parameter tractable parameterized by the backdoor depth into C Γ plus the domain size, which strictly generalize several known results for CSP that are based on backdoor size.
Classifying Constraint Satisfaction Problems A Proposal for a Bachelor’s or a Master’s Thesis
TL;DR: In this article , the authors explore some related questions in the computational complexity of the constraint satisfaction problem (CSP) in the Sudoku puzzle, where the goal is to fill out the remaining squares with the numbers of 1 to 9 so that the following constraints are satisfied: the numbers in each row, each column, and each 3× 3 box with bold edges should be different.
Journal ArticleDOI
Parameterized Complexity of Equality MinCSP
George Osipov,Magnus Wahlstrom +1 more
TL;DR: In this paper , the complexity of MinCSP for finite equality languages is studied, where the relations are defined via first-order formulas whose only predicate is $=$ and the objective function is to find a constant factor FPT-approximation unless FPT=W[2].
Posted Content
Generalisations of Matrix Partitions : Complexity and Obstructions.
TL;DR: In this paper, it was shown that for a fixed trigraph, the set of inclusion-wise minimal obstructions is finite if and only if it is finite for trigraphs.
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