A new algorithm for constraint satisfaction problems with few subpowers templates
classification
🧮 math.LO
keywords
algorithmconstraintproblemssatisfactionsubpowerstemplatesabsorbingarticle
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.