Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

STACS
1987
Springer

favoriteEmaildiscussreport

124views Theoretical Computer Science» more STACS 1987»

Graph Isomorphism is in the Low Hierarchy

13 years 7 months ago

Graph Isomorphism is in the Low Hierarchy

Download www.uni-ulm.de

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

Real-time Traffic

Graph Isomorphism Problem | Low Hierarchy | Polynomial-time Hierarchy Collapses | STACS 1987 | Theoretical Computer Science |

claim paper

Related Content

» Bounded Color Multiplicity Graph Isomorphism is in the L Hierarchy

» Complexity of Ring Morphism Problems

» Graph Isomorphism is Low for PP

» Taxonomysuperimposed graph mining

» Matching Hierarchies of Deformable Shapes

» Mining Frequent Subgraph by Incidence Matrix Normalization

» Inference of node replacement graph grammars

» Heuristics for Improving Cryptographic Key Assignment in a Hierarchy

» Low Power Storage Cycle Budget Distribution Tool Support for Hierarchical Graphs

Post Info
More Details (n/a)

Added	28 Aug 2010
Updated	28 Aug 2010
Type	Conference
Year	1987
Where	STACS
Authors	Uwe Schöning

Comments (0)