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 条

[1] A polynomial time algorithm to compute the Abelian kernel of a finite monoid
Delgado, M
Héam, PC
SEMIGROUP FORUM, 2003, 67 (01) : 97 - 110
[2] Abelian kernels, solvable monoids and the abelian kernel length of a finite monoid
Delgado, M
Fernandes, VH
SEMIGROUPS AND LANGUAGES, 2004, : 68 - 85
[3] An algorithm to compute ω-primality in a numerical monoid
David F. Anderson
Scott T. Chapman
Nathan Kaplan
Desmond Torkornoo
Semigroup Forum, 2011, 82 : 96 - 108
[4] An algorithm to compute ω-primality in a numerical monoid
Anderson, David F.
Chapman, Scott T.
Kaplan, Nathan
Torkornoo, Desmond
SEMIGROUP FORUM, 2011, 82 (01) : 96 - 108
[5] Commutative images of rational languages and the Abelian kernel of a monoid
Delgado, M
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2001, 35 (05): : 419 - 435
[6] A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average Time
Lairez, Pierre
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2017, 17 (05) : 1265 - 1292
[7] A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average Time
Pierre Lairez
Foundations of Computational Mathematics, 2017, 17 : 1265 - 1292
[8] A Polynomial Time Algorithm to Compute Geodesics in CAT(0) Cubical Complexes
Hayashi, Koyo
DISCRETE & COMPUTATIONAL GEOMETRY, 2021, 65 (03) : 636 - 654
[9] A Polynomial Time Algorithm to Compute Geodesics in CAT(0) Cubical Complexes
Koyo Hayashi
Discrete & Computational Geometry, 2021, 65 : 636 - 654
[10] An algorithm to compute the finite roots of large systems of polynomial equations arising in kinematic synthesis
Baskar, Aravind
Bandyopadhyay, Sandipan
MECHANISM AND MACHINE THEORY, 2019, 133 : 493 - 513

← 1 2 3 4 5 →