# A Proof of CSP Dichotomy Conjecture

@article{Zhuk2017APO,
title={A Proof of CSP Dichotomy Conjecture},
author={Dmitriy Zhuk},
journal={2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)},
year={2017},
pages={331-342}
}
• Dmitriy Zhuk
• Published 6 April 2017
• Mathematics, Computer Science
• 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
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 parametrize 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…
297 Citations
Finitely Tractable Promise Constraint Satisfaction Problems
• Computer Science
MFCS
• 2021
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 the CSP Dichotomy Conjecture
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.
Descriptive complexity of constraint problems
A dichotomy on the number of levels in the Lasserre hierarchy necessary to obtain an exact solution is proved, which proves that a dichotomy exists also in the general case of CSPs, and several results on the definability of VCSPs are obtained.
Time Complexity of Constraint Satisfaction via Universal Algebra
• Computer Science, Mathematics
MFCS
• 2017
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.
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)
• Mathematics
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
• 2019
It is shown that local satisfaction and global satisfaction of nontrivial height 1 identities differ for $\omega$ -categorical structures with less than double exponential orbit growth, thereby resolving one of the main open problems in the algebraic theory of such structures.
Universal Algebraic Methods for Constraint Satisfaction Problems
• Mathematics, Computer Science
Log. Methods Comput. Sci.
• 2022
The utility of new techniques that help attack the class of finite algebras known as "commutative idempotent binars" (CIBs) are demonstrated by using them to prove that every CIB of cardinality at most 4 yields a tractable CSP.
Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems)
• Mathematics
ArXiv
• 2019
It is shown that local satisfaction and global satisfaction of non-trivial height 1 identities differ for $\omega$-categorical structures with less than double exponential orbit growth, thereby resolving one of the main open problems in the algebraic theory of such structures.
A dichotomy theorem for nonuniform CSPs simplified
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.
Complexity of Infinite-Domain Constraint Satisfaction
This monograph presents a self-contained introduction to the universal-algebraic approach to complexity classification, treating both finite and infinite-domain CSPs.
Proof complexity of CSP on algebras with linear congruence
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.

## References

SHOWING 1-10 OF 95 REFERENCES
Closure properties of constraints
• Mathematics
JACM
• 1997
This paper investigates the subclasses that arise from restricting the possible constraint types, and shows that any set of constraints that does not give rise to an NP-complete class of problems must satisfy a certain type of algebraic closure condition.
A modifiction of the CSP algorithm for infinite languages
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.
Classifying the Complexity of Constraints Using Finite Algebras
• Mathematics
SIAM J. Comput.
• 2005
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.
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Every subproblem of the CSP is either tractable or NP-complete, and the criterion separating them is that conjectured in Bulatov et al.
The complexity of satisfiability problems
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.
A Dichotomy Theorem for Nonuniform CSPs
• A. Bulatov
• Mathematics
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
• 2017
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.
Complexity Classification in Infinite-Domain Constraint Satisfaction
This thesis studies CSPs where the variables can take values from an infinite domain, and studies the limits of complexity classification, and presents classes of computational problems provably do not exhibit a complexity dichotomy into hard and easy problems.
A Dichotomy for First-Order Reducts of Unary Structures
• Mathematics, Computer Science
Log. Methods Comput. Sci.
• 2018
This work uses a general polynomial-time reduction from such infinite-domain CSPs to finite- domains to obtain new powerful polynometric-time tractability conditions that can be expressed in terms of the topological polymorphism clone of A.
An algebraic hardness criterion for surjective constraint satisfaction
This work presents an algebraic condition on the polymorphism clone of B and proves that it is sufficient for the hardness of the surjective CSP on a finite structure B, in the sense that this problem admits a reduction from a certain fixed-structure CSP.
Tractable conservative constraint satisfaction problems
• A. Bulatov
• Computer Science
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
• 2003
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.