Graph Isomorphism and Circuit Size
Computational Complexity
2018-04-03 v2
Abstract
It is well-known [KST93] that the complexity of the Graph Automorphism problem is characterized by a special case of Graph Isomorphism, where the input graphs satisfy the "promise" of being rigid (that is, having no nontrivial automorphisms). In this brief note, we observe that the reduction of Graph Automorphism to the Rigid Graph Ismorphism problem can be accomplished even using Grollman and Selman's notion of a "smart reduction".
Cite
@article{arxiv.1511.08189,
title = {Graph Isomorphism and Circuit Size},
author = {Eric Allender and Joshua A. Grochow and Dieter van Melkebeek and Cristopher Moore and Andrew Morgan},
journal= {arXiv preprint arXiv:1511.08189},
year = {2018}
}
Comments
6 pages