Generalized Majority-Minority Operations are Tractable
计算复杂性
2017-01-11 v2 计算机科学中的逻辑
摘要
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.
引用
@article{arxiv.cs/0609108,
title = {Generalized Majority-Minority Operations are Tractable},
author = {Victor Dalmau},
journal= {arXiv preprint arXiv:cs/0609108},
year = {2017}
}