Blogger

Delete comment from: Computational Complexity

Anonymous said...

Follow up to my previous comment: It should be Schoning. Also, the result doesn't preclude the possibility that GI is in P. In fact, I can think of no good "evidence" that GI is not in P other than the fact that no one has found an algorithm for it. Does anyone know of any results in this direction?

Sep 13, 2005, 8:50:00 AM


Posted to Favorite Theorems: NP-Incomplete Sets

Google apps
Main menu