决定少数民族条款的存在
Deciding the existence of minority terms
摘要：
研究了判定给定的有限幂等代数是否有满足少数方程$m(y,x,x) \approx m(x,y,x) \approx m(x,x,y) \approx y$的三元项运算$m$的计算复杂性.我们表明，一个常见的多项式时间的方法来测试这种类型的条件将无法在这种情况下，这个判定问题在于类NP。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
