A new algorithm for constraint satisfaction problems with few subpowers templates
Dejan Delić, Amir El-Aooiti · arXiv (Cornell University) · 2017
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.