Computational Complexity of Checking Identities in 0-Simple Semigroups and Matrix Semigroups over Finite Fields

被引：0
|
作者：
Steve Seif
Csaba Szabo
机构：
[1] Department of Mathematics,
[2] University of Louisville,undefined
[3] Louisville,undefined
[4] Kentucky 40292,undefined
[5] Eotvos Lorand University,undefined
[6] Department of Algebra and Number Theory,undefined
[7] 1117 Budapest,undefined
[8] Pazmany Peter setany 1/c,undefined
来源：
Semigroup Forum | 2006年 / 72卷
关键词：
Computational Complexity; Finite Field; Word Problem; Check Identity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper we analyze the so-called word problem for (finite) combinatorial 0-simple semigroups and matrix semigroups from the viewpoint of computational complexity.
引用
收藏
页码：207 / 222
页数：15
相关论文
共 50 条
12345