A new algorithm for constraint satisfaction problems with few subpowers templates
Logic
2017-11-07 v1
Abstract
In this article, we provide a new algorithm for solving constraint satisfaction problems over templates with few subpowers, by reducing the problem to the combination of solvability of a polynomial number of systems of linear equations over finite fields and reductions via absorbing subuniverses.
Cite
@article{arxiv.1711.01943,
title = {A new algorithm for constraint satisfaction problems with few subpowers templates},
author = {Dejan Delic and Amir El-Aooiti},
journal= {arXiv preprint arXiv:1711.01943},
year = {2017}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1706.03451, arXiv:1709.08311