Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On the generic complexity of the searching graph isomorphism problem

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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

On the generic complexity of the searching graph isomorphism problem

Groups Complexity Cryptology , Volume 7 (2) – Nov 1, 2015

Loading next page...
 
/lp/de-gruyter/on-the-generic-complexity-of-the-searching-graph-isomorphism-problem-Ef76UJn5tz
Publisher
de Gruyter
Copyright
Copyright © 2015 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2015-0015
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Groups Complexity Cryptologyde Gruyter

Published: Nov 1, 2015

There are no references for this article.