A Proof of the CSP Dichotomy Conjecture
Top Cited Papers
- 26 August 2020
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 67 (5), 1-78
- https://doi.org/10.1145/3402029
Abstract
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The standard way to parameterize interesting subclasses of the constraint satisfaction problem is via finite constraint languages. The main problem is to classify those subclasses that are solvable in polynomial time and those that are NP-complete. It was conjectured that if a constraint language has a weak near-unanimity polymorphism then the corresponding constraint satisfaction problem is tractable; otherwise, it is NP-complete. In the article, we present 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.1Keywords
Funding Information
- Russian Foundation for Basic Research (19-01-00200)
- European Research Council (771005)
This publication has 41 references indexed in Scilit:
- The cardinality of the set of all clones containing a given minimal clone on three elementsAlgebra universalis, 2012
- Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction ProblemLogical Methods in Computer Science, 2012
- The complexity of temporal constraint satisfaction problemsJournal of the ACM, 2010
- Closure properties of constraintsJournal of the ACM, 1997
- Tractable constraints on ordered domainsArtificial Intelligence, 1995
- Characterising tractable constraintsArtificial Intelligence, 1994
- Fast parallel constraint satisfactionArtificial Intelligence, 1993
- Consistency in networks of relationsArtificial Intelligence, 1977
- Galois theory for Post algebras. IICybernetics and Systems Analysis, 1969
- Closed systems of functions and predicatesPacific Journal of Mathematics, 1968