On the generic complexity of the searching graph isomorphism problem

Abstract 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.