Generalized Majority-Minority Operations are Tractable

Details Generalized Majority-Minority Operations are Tractable Generalized Majority-Minority Operations are Tractable

2006-09-19

arxiv.org/abs/cs/0609108v2

LMCS 2 (4:1) 2006

Computer Science

Computational Complexity

Scientific paper

10.2168/LMCS-2(4:1)2006

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.

Affiliated with

Also associated with

No associations

Rating

Generalized Majority-Minority Operations are Tractable does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generalized Majority-Minority Operations are Tractable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized Majority-Minority Operations are Tractable will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-465625