Assertion: graph isomorphism | /r/CapableOf | separate problem
Facets:
value: from the np-complete problems
type: OTHER
value: in p
type: LOCATION
Source sentences:
text: If this is indeed the case, however, don’t expect a proof anytime soon: Proving it would amount to solving the P versus NP problem, since it would mean that graph isomorphism separates the problems in P from the NP-complete problems.