scientific article; zbMATH DE number 59506

MaRDI QIDQ4007591zbMATH OpenFDO

Authors V. A. Makarenko

Publication date 27 September 1992

zbMATH Keywords

algorithmisomorphism of finite simple semigroupssandwich-matricestime complexity

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Mappings of semigroups (20M15) Symbolic computation and algebraic computation (68W30)

Recommendations

• Algorithms for computing finite semigroups
• ON GENERIC COMPLEXITY OF THE ISOMORPHISM PROBLEM FOR FINITE SEMIGROUPS
• Algorithmic problems for finite groups and finite \(0\)-simple semigroups
• Finding the isomorphisms of 0-simple semigroups
• On the efficiency of finite simple semigroups
• Algorithmic recognition of identities in one class of finitely presented semigroups
• Algorithms for group isomorphism via group extensions and cohomology
• Improved lower bounds for the complexity of finite semigroups
• Algorithms determining finite simple images of finitely presented groups
• scientific article; zbMATH DE number 4165183

Cited in

(2)

• Finding the isomorphisms of 0-simple semigroups
• ON GENERIC COMPLEXITY OF THE ISOMORPHISM PROBLEM FOR FINITE SEMIGROUPS

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4007591)