Sciweavers

Share
STACS
1987
Springer

Graph Isomorphism is in the Low Hierarchy

9 years 2 months ago
Graph Isomorphism is in the Low Hierarchy
It is shown that the graph isomorphism problem is located in the low hierarchy in NP. This implies that this problem is not NPcomplete (not even under weaker forms of polynomial-time reducibilities, such as y-reducibility) unless the polynomial-time hierarchy collapses.
Uwe Schöning
Added 28 Aug 2010
Updated 28 Aug 2010
Type Conference
Year 1987
Where STACS
Authors Uwe Schöning
Comments (0)
books