DocumentCode :
2734227
Title :
On the hardness of graph isomorphism
Author :
Torán, Jacobo
Author_Institution :
Abteilung Theor. Inf., Ulm Univ., Germany
fYear :
2000
fDate :
2000
Firstpage :
180
Lastpage :
186
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 ModkL and for the class DET of problems NC1 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
Keywords :
computational complexity; encoding; graph theory; complexity classes; determinant; graph isomorphism; hardness; hardness results; logarithmic space many-one reductions; perfect matching; probabilistic logarithmic space; randomized logarithmic space reduction; Circuits; Eigenvalues and eigenfunctions; Encoding; Jacobian matrices; NP-complete problem; Orbits; Polynomials; Tree graphs; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on
Conference_Location :
Redondo Beach, CA
ISSN :
0272-5428
Print_ISBN :
0-7695-0850-2
Type :
conf
DOI :
10.1109/SFCS.2000.892080
Filename :
892080
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2734227
بازگشت