Loading ...
Sorry, an error occurred while loading the content.

[My Computational Complexity Web Log] Is P versus NP formally independent?

Expand Messages
  • Lance Fortnow
    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
    Message 1 of 1 , Sep 9 10:59 AM
    • 0 Attachment
      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
    Your message has been successfully submitted and would be delivered to recipients shortly.