有限幂等代数中Maltsev条件的判定
Deciding some Maltsev conditions in finite idempotent algebras
摘要：
在本文中，我们研究的计算复杂性，如果一个给定的有限代数结构满足一个固定的（强）Maltsev条件$Σ$。本文的目标是证明当被测代数是幂等的且Maltsev条件$Σ$可以用路径描述时，$Σ$ -测试可以在多项式时间内完成.这样的路径条件的例子是具有Maltsev项、具有多数运算、以及具有固定长度的Jónsson（或Gumm）项的链。
英文摘要：
In this paper we investigate the computational complexity of deciding if a given finite algebraic structure satisfies a fixed (strong) Maltsev condition $Σ$. Our goal in this paper is to show that $Σ$-testing can be accomplished in polynomial time when the algebras tested are idempotent and the Maltsev condition $Σ$ can be described using paths. Examples of such path conditions are having a Maltsev term, having a majority operation, and having a chain of Jónsson (or Gumm) terms of fixed length.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
