2000 character limit reached
A new algorithm for constraint satisfaction problems with Maltsev templates
Published 25 Sep 2017 in cs.LO | (1709.08311v2)
Abstract: In this article, we provide a new algorithm for solving constraint satisfaction problems with Maltsev constraints, based on the new notion of Maltsev consistency.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.