A dichotomy theorem for nonuniform CSPs
Computational Complexity
2017-04-07 v2
Abstract
In this paper we prove the Dichotomy Conjecture on the complexity of nonuniform constraint satisfaction problems posed by Feder and Vardi.
Keywords
Cite
@article{arxiv.1703.03021,
title = {A dichotomy theorem for nonuniform CSPs},
author = {Andrei A. Bulatov},
journal= {arXiv preprint arXiv:1703.03021},
year = {2017}
}
Comments
Apart from correcting typos and inaccuracies, this version of the paper is different from the first arXiv version in the following ways: A self-contained high level presentation of the main results is added; the Preliminaries section is extended, several proofs are reorganized and expanded for improved readability