An important unsolved problem in complexity theory is whether the graph isomorphism problem is in P, NP-complete, or NP-intermediate.
What class is most commonly not ascribed to the graph isomorphism problem in spite of definitive determination?
NP-complete