[My Computational Complexity Web Log] Is P versus NP formally independent?
As promised back in March, the October 2003 BEATCS Complexity Column is on whether we can truly settle the P versus NP question. Scott Aaronson gives quite an interesting survey on this topic.
Posted by Lance Fortnow to My Computational Complexity Web Log at 9/9/2003 01:56:21 PM
Powered by Blogger Pro