A Dichotomy Theorem for Nonuniform CSPs

In a non-uniform Constraint Satisfaction problem CSP(Γ), where Γ is a set of relations on a unite set A, the goal is to und an assignment of values to variables subject to constraints imposed on speciued sets of variables using the relations from Γ. The Dichotomy Conjecture for the non-uniform CSP s...

Full description

Saved in:
Bibliographic Details
Published inAnnual Symposium on Foundations of Computer Science pp. 319 - 330
Main Author Bulatov, Andrei A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2017
Subjects
Algebra
Algorithm design and analysis
Complexity theory
Computer science
Constraint Satisfaction problem
dichotomy conjecture
Electronic mail
Terminology
Online AccessGet full text
ISSN0272-5428
DOI10.1109/FOCS.2017.37

Cover

More Information
Summary:In a non-uniform Constraint Satisfaction problem CSP(Γ), where Γ is a set of relations on a unite set A, the goal is to und an assignment of values to variables subject to constraints imposed on speciued sets of variables using the relations from Γ. The Dichotomy Conjecture for the non-uniform CSP states that for every constraint language Γ 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.
ISSN:0272-5428
DOI:10.1109/FOCS.2017.37