...
首页> 外文期刊>Journal of multiple-valued logic and soft computing >Deciding the Existence of Quasi Weak Near Unanimity Terms in Finite Algebras
【24h】

Deciding the Existence of Quasi Weak Near Unanimity Terms in Finite Algebras

机译:在有限的代数中决定了Quasi弱的弱势术语

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

We show that for a fixed positive integer k one can efficiently decide if a finite algebra A admits a k-ary weak near unanimity operation by looking at the local behavior of the terms of A. We also observe that the problem of deciding if a given finite algebra has a quasi Taylor operation is solvable in polynomial time by looking, essentially, for local quasi Siggers operations.
机译:我们表明,对于固定的正整数K,可以通过查看A的局部行为,有效地决定有限的代数A是否承认了k-ary弱的近乎一致的操作。我们也观察到确定如果给定的问题 有限代数具有准泰勒运行,通过看起来,基本上是用于当地的拟枪手操作的多项式时间。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号