Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Groups Complexity Cryptology

Managing Editor: Shpilrain, Vladimir / Weil, Pascal

Editorial Board: Ciobanu, Laura / Conder, Marston / Eick, Bettina / Elder, Murray / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Perret, Ludovic / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura / Lohrey, Markus

CiteScore 2018: 0.80

SCImago Journal Rank (SJR) 2018: 0.368
Source Normalized Impact per Paper (SNIP) 2018: 1.061

Mathematical Citation Quotient (MCQ) 2017: 0.32

See all formats and pricing
More options …

On the generic complexity of the searching graph isomorphism problem

Alexander Rybalov
Published Online: 2015-10-08 | DOI: https://doi.org/10.1515/gcc-2015-0015


A generic-case approach to algorithmic problems was suggested by Myasnikov, Kapovich, Schupp and Shpilrain in 2003. This approach studies the behavior of an algorithm on typical inputs and ignores the rest of the inputs. In this paper we consider generic complexity of the searching graph isomorphism problem. We fit this problem in the frameworks of generic complexity and prove that its natural subproblem is generically hard provided that the searching graph isomorphism problem is hard in the worst case.

Keywords: Generic-case complexity; graph isomorphism; searching graph isomorphism problem

MSC: 68Q17

About the article

Received: 2015-07-15

Published Online: 2015-10-08

Published in Print: 2015-11-01

Funding Source: Russian Science Foundation

Award identifier / Grant number: 14-11-00085

Citation Information: Groups Complexity Cryptology, Volume 7, Issue 2, Pages 191–193, ISSN (Online) 1869-6104, ISSN (Print) 1867-1144, DOI: https://doi.org/10.1515/gcc-2015-0015.

Export Citation

© 2015 by De Gruyter.Get Permission

Citing Articles

Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.

Comments (0)

Please log in or register to comment.
Log in