Blogger

Delete comment from: Computational Complexity

Anonymous said...

On the other hand, proving P=NP wouldn't be THAT much harder than verifying it.

Sep 7, 2010, 10:36:11 AM


Posted to How to Write Up Major Results

Google apps
Main menu