Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4952169 | Theoretical Computer Science | 2017 | 23 Pages |
Abstract
Universal algebraic methods have been central to recent efforts in classifying the complexity of constraint satisfaction problems. A second contribution of the article is to develop aspects of the algebraic approach in the context of a number of variants of the constraint satisfaction problem. In particular, this allows us to lift our results on Boolean domains to many templates on non-Boolean domains.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Lucy Ham,