Paper Info
Title
On the hardness of graph isomorphism
Abstract
We show that the graph isomorphism problem is hard under logarithmic space many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space), for every logarithmic space modular class Mod/sub k/L and for the class DET of problems NC/sup 1/ reducible to the determinant. These are the strongest existing hardness results for the graph isomorphism problem, and imply a randomized logarithmic space reduction from the perfect matching problem to graph isomorphism.
Year
DOI
Venue
2004
10.1137/S009753970241096X
SIAM Journal on Computing
Keywords
DocType
Volume
polynomials,encoding,computational complexity,graph theory,complexity classes,graph isomorphism,complexity class,np complete problem,determinant,hardness,upper bound,circuits,perfect matching,tree graphs
Journal
33
Issue
ISSN
Citations 
5
0097-5397
34
PageRank 
References 
Authors
1.94
32
1
Name
Order
Citations
PageRank
Jacobo Torán156449.26