A Dichotomy Theorem for Nonuniform CSPs

By Andrei A. Bulatov. IEEE Annual Symposium on Foundations of Computer Science, 2017

506 citations recorded by the source corpus.

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.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/b8f72e5f3ccd0f26114f901ae9a5dd58b05bfc60