25 search results - page 1 / 5 » Graph Isomorphism is in the Low Hierarchy |
STACS
1987
Springer
13 years 8 months ago
1987
Springer
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-ti...
COCO
2005
Springer
13 years 10 months ago
2005
Springer
CC
2006
Springer
13 years 4 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
STACS
1992
Springer
13 years 8 months ago
1992
Springer
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...
EDBT
2008
ACM
13 years 6 months ago
2008
ACM
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...