We contribute to the algebraic study of the complexity of constraint satisfaction problems. We give a new sufficient condition on a set of relations R over a domain S for the tractability of CSP(R): if S is a block-group (a particular class of semigroups) of exponent w and R is a set of relations over S preserved by the operation defined by the polynomial f(x,y,z) = xy^(w-1)z over S, then CSP(R) is tractable. This theorem strictly improves on results of Feder and Vardi and Bulatov et al. and we demonstrate it by reproving an upper bound of Klima et al. We also investigate systematically the tractability of CSP(R) when R is a set of relations closed under operations that are all expressible as polynomials over a finite semigroup S. In particular, if S is a nilpotent group, we show that CSP(R) is tractable iff one of these polynomials defines a Malt'sev operation, and conjecture that this holds for all groups.
CitationDalmau, V., Gavaldà, R., Tesson, P., Thérien, D. "Tractable clones of polynomials over semigroups". 2005.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com