ON GENERIC COMPLEXITY OF THE ISOMORPHISM PROBLEM FOR FINITE SEMIGROUPS

DOI10.17223/20710410/51/6MaRDI QIDQ4986240zbMATH OpenOpenAlexFDO

Authors Alexander Rybalov

Publication date 27 April 2021

Published in Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/pdm734

zbMATH Keywords

finite semigroupsgeneric complexityisomorphism problem

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Free semigroups, generators and relations, word problems (20M05)

Recommendations

• On the generic complexity of the searching graph isomorphism problem
• Generic complexity of the word problem in some semigroups
• scientific article; zbMATH DE number 59506
• Generic complexity of the membership problem for semigroups of integer matrices
• Finding the isomorphisms of 0-simple semigroups

Cited in

(3)

• scientific article; zbMATH DE number 3979372 (Why is no real title available?)
• scientific article; zbMATH DE number 59506 (Why is no real title available?)
• scientific article; zbMATH DE number 1936760 (Why is no real title available?)

This page was built for publication: ON GENERIC COMPLEXITY OF THE ISOMORPHISM PROBLEM FOR FINITE SEMIGROUPS

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