A Dichotomy Theorem for Nonuniform CSPs

@article{Bulatov2017ADT,
  title={A Dichotomy Theorem for Nonuniform CSPs},
  author={Andrei A. Bulatov},
  journal={2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)},
  year={2017},
  pages={319-330}
}
  • A. Bulatov
  • Published 8 March 2017
  • Mathematics
  • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
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… 

Figures from this paper

A dichotomy theorem for nonuniform CSPs simplified
TLDR
The Dichotomy Conjecture for the non-uniform CSP states that for every constraint language G the problem CSP(G) is either solvable in polynomial time or is NP-complete.
A Proof of the CSP Dichotomy Conjecture
TLDR
This article presents an algorithm that solves Constraint Satisfaction Problem in polynomial time for constraint languages having a weak near unanimity polymorphism, which proves the remaining part of the conjecture.
Finitely Tractable Promise Constraint Satisfaction Problems
TLDR
This work begins a systematic study of this phenomenon by giving a general necessary condition for finite tractability and characterizing finite tractable within a class of templates - the "basic" tractable cases in the dichotomy theorem for symmetric Boolean PCSPs allowing negations by Brakensiek and Guruswami.
A Proof of CSP Dichotomy Conjecture
  • Dmitriy Zhuk
  • Mathematics, Computer Science
    2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
TLDR
An algorithm is presented that solves Constraint Satisfaction Problem in polynomial time for constraint languages having a weak near unanimity polymorphism, which proves the remaining part of the conjecture.
An Algebraic Approach to Valued Constraint Satisfaction
TLDR
A notion of polymorphism is introduced that captures the pp-definability in the style of Geiger’s result, and sufficient conditions for tractability of the classical CSP, related to the existence of certain polymorphisms, are shown to serve also for the valued case.
Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey
TLDR
This contribution surveys an alternative approach based on partial polymorphisms, which is useful for studying the fine-grained complexity of NP-complete CSPs, and state some challenging open problems in the research field.
Time Complexity of Constraint Satisfaction via Universal Algebra
TLDR
The worst-case time complexity of NP-complete CSPs, where one is allowed to arbitrarily restrict the values of individual variables, is studied, and it is proved that the complexity of CSP({SD}) is a lower bound for all C SPs of this particular kind.
Quantaloidal approach to constraint satisfaction
TLDR
It is pointed out that fundamental concepts of the CSP can be formulated abstractly inside the 2-category PFinSet of finite sets and sets of functions between them, and their computational complexity can be classified by the associated notion of polymorphism.
A modifiction of the CSP algorithm for infinite languages
TLDR
A modification of the algorithm that works in polynomial time even for infinite constraint languages is presented, which proves that if a constraint language has a weak near unanimity polymorphism then the corresponding constraint satisfaction problem is tractable, otherwise it is NP-complete.
Proof complexity of CSP on algebras with linear congruence
TLDR
Zhuk’s algorithm for negative instances of the CSP problem can be augmented by extra information: it not only rejects X that cannot be homomorphically mapped into A, but produces a certificate a short extended Frege (EF) propositional proof that this rejection is correct.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 90 REFERENCES
The Dichotomy for Conservative Constraint Satisfaction Problems Revisited
  • L. Barto
  • Computer Science
    2011 IEEE 26th Annual Symposium on Logic in Computer Science
  • 2011
TLDR
This paper provides a short and transparent proof of the dichotomy conjecture of Feder and Vardi stating that the CSP over a fixed constraint language is either NP-complete, or tractable.
Conservative constraint satisfaction re-revisited
Asking the Metaquestions in Constraint Tractability
TLDR
This article systematically studies—for various classes of polymorphisms—the computational complexity of deciding whether or not a given structure ℍ admits a polymorphism from the class, and proves the NP-completeness of deciding a condition conjectured to characterize the tractable problems CSP(ℍ).
A dichotomy theorem for constraints on a three-element set
  • A. Bulatov
  • Computer Science
    The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
  • 2002
TLDR
Every subclass of the CSP defined by a set of allowed constraints is either tractable or NP-complete, and the criterion separating them is that conjectured by Bulatov et al. (2001).
Monotone monadic SNP and constraint satisfaction
TLDR
The question whether every problem in CSP is either in P or is NP-complete is posed, and the class of constraint-satisfaction problems with respect to fixed templates is defined.
A dichotomy theorem for constraint satisfaction problems on a 3-element set
TLDR
Every subproblem of the CSP is either tractable or NP-complete, and the criterion separating them is that conjectured in Bulatov et al.
Complexity of conservative constraint satisfaction problems
TLDR
This work completely characterize conservative constraint languages that give rise to polynomial time solvable CSP classes, and obtains a complete description of those (directed) graphs H for which the List H-Coloring problem is solvable in polynometric time.
Tractable conservative constraint satisfaction problems
  • A. Bulatov
  • Computer Science
    18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
  • 2003
TLDR
This work completely characterize conservative constraint languages that give rise to CSP classes solvable in polynomial time, and obtains a complete description of those (directed) graphs H for which the List H-Coloring problem is poynomial time solvable.
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
TLDR
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.
...
1
2
3
4
5
...