A polynomial time algorithm to compute the Abelian kernel of a finite monoid

被引：0
|
作者：
Manuel Delgado
Pierre-Cyrille Héam
机构：
[1] Centro de Matemática da Universidade do Porto,
[2] LIFC,undefined
[3] Université de Franche-Comté,undefined
来源：
Semigroup Forum | 2003年 / 67卷
关键词：
Polynomial Time Algorithm; Cayley Graph; Free Abelian Group; Label Graph; Natural Morphism;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The time complexity of the best previously known algorithm to compute the Abelian kernel of a finite monoid with a fixed number of generators is exponential. In this paper we use results on subgroups of the free Abelian group and constructions on labeled graphs to develop a polynomial time algorithm for this problem.
引用
收藏
页码：97 / 110
页数：13
相关论文
共 50 条
12345