1 search results - page 1 / 1 » stacs 1987 |
114
Voted
STACS
1987
Springer
15 years 6 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...