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
Proceedings ArticleDOI
Cohomology in Constraint Satisfaction and Structure Isomorphism
TL;DR: A novel sheaf-theoretic approach to CSP and SI and their approximations is introduced and it is shown that cohomological k -consistency can solve systems of equations over all finite rings and that cohomeological Weisfeiler-Leman can distinguish positive and negative instances of the Cai-Fürer-Immerman property over several important classes of structures.
Journal ArticleDOI
Functorial Question Answering
TL;DR: The authors showed that DisCo models in the category of sets and relations correspond precisely to relational databases, and defined question answering as an NP-complete problem, and showed complexity-theoretic reductions from semantics and entailment of a fragment of natural language to evaluation and containment of conjunctive queries.
Proceedings ArticleDOI
Testability of Homomorphism Inadmissibility: Property Testing Meets Database Theory
Hubie Chen,Yuichi Yoshida +1 more
TL;DR: The characterization shows that homomorphism inadmissibility from A is constant-query testable with one-sided error if and only if the core of A is alpha-acyclic; this result generalizes existing results for testing subgraph-freeness in the general graph model.
Journal ArticleDOI
Even Delta-Matroids and the Complexity of Planar Boolean CSPs
TL;DR: In this article, a generalization of the classical blossom algorithm for finding perfect matchings is presented, where each variable appears in exactly two constraints and all constraints are even Δ-matroid relations (represented by lists of tuples).
Journal ArticleDOI
Graph homomorphism reconfiguration and frozen H‐colorings
TL;DR: The hardness proof involves a reduction from a CSP problem which is shown to be NP-complete by establishing the non-existence of a certain type of polymorphism.
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