%0 Journal Article
%T Generalized Majority-Minority Operations are Tractable
%A Victor Dalmau
%J Computer Science
%D 2006
%I arXiv
%R 10.2168/LMCS-2(4:1)2006
%X Generalized majority-minority (GMM) operations are introduced as a common generalization of near unanimity operations and Mal'tsev operations on finite sets. We show that every instance of the constraint satisfaction problem (CSP), where all constraint relations are invariant under a (fixed) GMM operation, is solvable in polynomial time. This constitutes one of the largest tractable cases of the CSP.
%U http://arxiv.org/abs/cs/0609108v2