A Simple Algorithm for Mal'tsev Constraints
Victor Dalmau and Andrei Bulatov
SIAM Journal on Computing Volume 36, Number 1, pp. 16-27, 2006.

## Abstract

A Mal'tsev operation is a ternary operation $\varphi$ that satisfies the identities $\varphi(x,y,y) = \varphi(y,y,x) = x$. Constraint satisfaction problems involving constraints invariant under a Mal'tsev operation constitute an important class of constraint satisfaction problems, which includes the affine satisfiability problem, subgroupand near subgroup constraints, and many others. It is also known that any tractable case of the counting constraint satisfaction problem involves only Mal'tsev constraints.The first algorithm solving the arbitrary constraint satisfaction problem with Mal'tsev constraints has been given by Bulatov. However, this algorithm is very sophisticated and relies heavily on advanced algebraic machinery. In this paper, we give a different and much simpler algorithm for this type of constraint

 Postscript - Requires a viewer, such as GhostView
EPrint Type: Article Project Keyword UNSPECIFIED Theory & Algorithms 2905 Victor Dalmau 23 November 2006