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

Re: 10^12000+3213 and P =/= NP

Expand Messages
  • d.broadhurst@open.ac.uk
    ... Thanks, Jud. I uncritically accepted the final sentence of http://www.claymath.org/prizeproblems/pvsnp.htm Stephen Cook formulated the P versus NP problem
    Message 1 of 18 , Mar 30, 2001
    • 0 Attachment
      Jud McCranie wrote:
      > Milton's right this time. Cook came up with NP-completeness.
      Thanks, Jud.
      I uncritically accepted the final sentence of
      http://www.claymath.org/prizeproblems/pvsnp.htm
      "Stephen Cook formulated the P versus NP problem in 1971."
      Happy to accept your better informed judgement.
      David
    Your message has been successfully submitted and would be delivered to recipients shortly.