Searching for "Graph Isomorphism is in the Low Hierarchy." – sorted by Relevance.
-
Around the PCP Theorem
- observations about collapsing the polynomial-time hierarchy, it is clear that Graph Isomorphism cannot be NP
- Cited by 2 (0 self) – Add To MetaCart

