On the reduction of the CSP dichotomy conjecture to digraphs
Computational Complexity
2013-08-05 v2 Combinatorics
Abstract
It is well known that the constraint satisfaction problem over general relational structures can be reduced in polynomial time to digraphs. We present a simple variant of such a reduction and use it to show that the algebraic dichotomy conjecture is equivalent to its restriction to digraphs and that the polynomial reduction can be made in logspace. We also show that our reduction preserves the bounded width property, i.e., solvability by local consistency methods. We discuss further algorithmic properties that are preserved and related open problems.
Keywords
Cite
@article{arxiv.1305.2039,
title = {On the reduction of the CSP dichotomy conjecture to digraphs},
author = {Jakub Bulin and Dejan Delic and Marcel Jackson and Todd Niven},
journal= {arXiv preprint arXiv:1305.2039},
year = {2013}
}
Comments
34 pages. Article is to appear in CP2013. This version includes two appendices with proofs of claims omitted from the main article