Finding the isomorphisms of 0-simple semigroups

DOI10.1007/BF01078900zbMath0653.20066OpenAlexW2017243545MaRDI QIDQ3798887

V. A. Makarenko

Publication date: 1987

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01078900

zbMATH Keywords

algorithmtime complexitystructure groups0-simple semigroupssandwich matrices

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) General structure theory for semigroups (20M10) Software, source code, etc. for problems pertaining to group theory (20-04)

Cites Work

• Construction of an effective algorithm to find the isomorphism of two simple finite semigroups
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding the isomorphisms of 0-simple semigroups