Generic case complexity of the Graph Isomorphism Problem

Generic case complexity of the Graph Isomorphism Problem Abstract The edge test is a partial algorithm for the Graph Isomorphism Problem based on comparison the number of edges. We perform a probabilistic analysis of the efficiency of the edge test. With the binomial distribution B ( n , p ) on the set of inputs, we estimate the asymptotic failure probability of the edge test depending on the rate of decay of parameter p . In particular, if p ≤ 1/2, n p → λ > 0, then the asymptotic failure probability is nonzero, so that the edge test does not solve generically the Graph Isomorphism Problem. On the other hand, if p ≤ 1/2, n p → ∞, then the failure set is negligible and the edge test generically solves the Graph Isomorphism Problem in polynomial time. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

Generic case complexity of the Graph Isomorphism Problem

, Volume 8 (1) – May 1, 2016
12 pages

/lp/de-gruyter/generic-case-complexity-of-the-graph-isomorphism-problem-NC2nDM5JDP
Publisher
de Gruyter
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2016-0008
Publisher site
See Article on Publisher Site

Abstract

Abstract The edge test is a partial algorithm for the Graph Isomorphism Problem based on comparison the number of edges. We perform a probabilistic analysis of the efficiency of the edge test. With the binomial distribution B ( n , p ) on the set of inputs, we estimate the asymptotic failure probability of the edge test depending on the rate of decay of parameter p . In particular, if p ≤ 1/2, n p → λ > 0, then the asymptotic failure probability is nonzero, so that the edge test does not solve generically the Graph Isomorphism Problem. On the other hand, if p ≤ 1/2, n p → ∞, then the failure set is negligible and the edge test generically solves the Graph Isomorphism Problem in polynomial time.

Journal

Groups Complexity Cryptologyde Gruyter

Published: May 1, 2016

References

Access the full text.