Delete comment from: Computational Complexity

Anonymous said...

Hi Lance, your last point is interesting. Why do you believe that there will be no other way to show the existence of incomplete sets, short of proving that P does not equal NP?

For example... are there reasons to believe that we cannot prove a statement like:

If P does not equal NP, then Graph isomorphism is NP-incomplete.

?

Sep 13, 2005, 4:19:00 AM

Posted to Favorite Theorems: NP-Incomplete Sets