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) \approx m(x,y,x) \approx m(x,x,y) \approx 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.

中文翻译：

---

确定少数条款的存在

本文研究了确定给定的有限幂等代数是否具有满足少数方程 $m(y,x,x) \approx m(x,y,x) \approx m( x,x,y) \近似 y$。我们表明，在这种情况下，用于测试此类条件的常用多项式时间方法将不起作用，并且该决策问题属于 NP 类。