Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikladnaya Diskretnaya Matematika. Supplement, 2021, Issue 14, Pages 178–180
DOI: https://doi.org/10.17223/2226308X/14/41
(Mi pdma560)
 

Mathematical Foundations of Informatics and Programming

On generic complexity of the isomorphism problem for finite semigroups

A. N. Rybalov

Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
References:
Abstract: Generic-case approach to algorithmic problems was suggested by A. Miasnikov, V. Kapovich, P. Schupp, and V. Shpilrain in 2003. This approach studies behavior of an algorithm on typical (almost all) inputs and ignores the rest of inputs. In this paper, we study the generic complexity of the isomorphism problem for finite semigroups. In this problem, for any two semigroups of the same order, given by their multiplication tables, it is required to determine whether they are isomorphic. V. Zemlyachenko, N. Korneenko, and R. Tyshkevich in 1982 proved that the graph isomorphism problem polynomially reduces to this problem. The graph isomorphism problem is a well-known algorithmic problem that has been actively studied since the 1970s, and for which polynomial algorithms are still unknown. So from a computational point of view the studied problem is no simpler than the graph isomorphism problem. We present a generic polynomial algorithm for the isomorphism problem of finite semigroups. It is based on the characterization of almost all finite semigroups as 3-nilpotent semigroups of a special form, established by D. Kleitman, B. Rothschild, and J. Spencer, as well as the Bollobas polynomial algorithm, which solves the isomorphism problem for almost all strongly sparse graphs.
Keywords: generic complexity, isomorphism, finite semigroups.
Document Type: Article
UDC: 510.52
Language: Russian
Citation: A. N. Rybalov, “On generic complexity of the isomorphism problem for finite semigroups”, Prikl. Diskr. Mat. Suppl., 2021, no. 14, 178–180
Citation in format AMSBIB
\Bibitem{Ryb21}
\by A.~N.~Rybalov
\paper On generic complexity of the isomorphism problem for finite semigroups
\jour Prikl. Diskr. Mat. Suppl.
\yr 2021
\issue 14
\pages 178--180
\mathnet{http://mi.mathnet.ru/pdma560}
\crossref{https://doi.org/10.17223/2226308X/14/41}
Linking options:
  • https://www.mathnet.ru/eng/pdma560
  • https://www.mathnet.ru/eng/pdma/y2021/i14/p178
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Prikladnaya Diskretnaya Matematika. Supplement
    Statistics & downloads:
    Abstract page:95
    Full-text PDF :26
    References:16
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024