CSP for binary conservative relational structures
Combinatorics
2016-02-11 v2
Abstract
We prove that whenever A is a 3-conservative relational structure with only binary and unary relations then the algebra of polymorphisms of A either has no Taylor operation (i.e. CSP(A) is NP-complete), or generates a congruence meet semidistributive variety (i.e. CSP(A) has bounded width).
Cite
@article{arxiv.1112.1099,
title = {CSP for binary conservative relational structures},
author = {Alexandr Kazda},
journal= {arXiv preprint arXiv:1112.1099},
year = {2016}
}
Comments
9 pages, 3 figures