**The constraint satisfaction problem with Maltsev constraints**

I present an algorithm (Bulatov and Dalmau, 2006) which solves in
polynomial time the constraint satisfaction problem whose constraints are
preserved by a Maltsev operation (a ternary operation f such that f(x,y,y)
= f(y,y,x) = x).