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 条
  • [31] AN ALGORITHM TO COMPUTE THE KAUFFMAN POLYNOMIAL OF 2-BRIDGE KNOTS
    Lu, Bin
    Zhong, Jianyuan K.
    ROCKY MOUNTAIN JOURNAL OF MATHEMATICS, 2010, 40 (03) : 977 - 993
  • [32] A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number
    Maria, Clement
    Spreer, Jonathan
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 2721 - 2732
  • [33] A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over Z[x]
    Jing, Rui-Juan
    Yuan, Chun-Ming
    Gao, Xiao-Shan
    THEORETICAL COMPUTER SCIENCE, 2019, 755 : 89 - 109
  • [34] A polynomial-time algorithm for linear optimization based on a new simple kernel function
    Bai, YQ
    Roos, C
    OPTIMIZATION METHODS & SOFTWARE, 2003, 18 (06): : 631 - 646
  • [35] A polynomial-time algorithm for linear optimization based on a new class of kernel functions
    El Ghami, M.
    Ivanov, I.
    Melissen, J. B. M.
    Roos, C.
    Steihaug, T.
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2009, 224 (02) : 500 - 513
  • [36] Canonical kernel representations for behaviors over finite Abelian groups
    Fagnani, F
    Zampieri, S
    SYSTEMS & CONTROL LETTERS, 1997, 32 (05) : 271 - 282
  • [37] A Polynomial-Time Algorithm for Computing Finite-Makespan Controllable Sublanguages
    Su, Rong
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2015, 60 (02) : 534 - 539
  • [38] A new algorithm to compute fuzzy subgroups of a finite group
    Farooq, Adeel
    Hussain, Musawwar
    Yousaf, Muhammad
    Al-Kenani, Ahmad N.
    AIMS MATHEMATICS, 2023, 8 (09): : 20802 - 20814
  • [39] ALGORITHM TO COMPUTE DISTANCES IN FINITE, DIRECTED AND NONVALUED GRAPHS
    BAUERSFELD, G
    ESSMANN, C
    LOHLE, H
    COMPUTING, 1972, 10 (1-2) : 107 - 109
  • [40] A POLYNOMIAL-TIME ALGORITHM FOR THE LOCAL TESTABILITY PROBLEM OF DETERMINISTIC FINITE AUTOMATA
    KIM, S
    MCNAUGHTON, R
    MCCLOSKEY, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 382 : 420 - 436
12345