Generalized Majority-Minority Operations are Tractable
<|reference_start|>Generalized Majority-Minority Operations are Tractable: 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.<|reference_end|>
@article{dalmau2006generalized,
    title={Generalized Majority-Minority Operations are Tractable},
    author={Victor Dalmau},
    journal={Logical Methods in Computer Science, Volume 2, Issue 4 (September
  28, 2006) lmcs:2237},
    year={2006},
    doi={10.2168/LMCS-2(4:1)2006},
    archivePrefix={arXiv},
    eprint={cs/0609108},
    primaryClass={cs.CC cs.LO}
}