Deciding the existence of minority terms

01/02/2019
by   Alexandr Kazda, et al.
0

This paper investigates the computational complexity of deciding if a given finite idempotent algebra has a ternary term operation m that satisfies the minority equations m(y,x,x) ≈ m(x,y,x) ≈ m(x,x,y) ≈ y. We show that a common polynomial-time approach to testing for this type of condition will not work in this case and that this decision problem lies in the class NP.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset