A Proof of the CSP Dichotomy Conjecture

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 cons...

Full description

Saved in:
Bibliographic Details
Published inJournal of the ACM Vol. 67; no. 5; pp. 1 - 78
Main Author Zhuk, Dmitriy
Format Journal Article
LanguageEnglish
Published New York Association for Computing Machinery 01.10.2020
Subjects
Algorithms
Combinatorial analysis
Languages
Polymorphism
Polynomials
Online AccessGet full text

Cover

More Information
Summary: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. 1
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0004-5411
1557-735X
DOI:10.1145/3402029