{"id":2,"date":"2013-03-01T16:03:18","date_gmt":"2013-03-01T16:03:18","guid":{"rendered":"http:\/\/goldenticket.fortnow.com\/?page_id=2"},"modified":"2019-02-02T17:44:47","modified_gmt":"2019-02-02T22:44:47","slug":"sample-page","status":"publish","type":"page","link":"https:\/\/goldenticket.fortnow.com\/?page_id=2","title":{"rendered":"More P v NP"},"content":{"rendered":"

Steve Cook’s\u00a0<\/span>Official P versus NP problem Description<\/a>\u00a0 for the <\/span>Clay Mathematics Institute Millennium\u00a0Prizes<\/a><\/p>\n

Lance Fortnow’s September 2009 Communications of the ACM<\/em> article The Status of the P versus NP Problem<\/a>\u00a0that inspired this book.<\/p>\n

G\u00f6del’s 1956 letter to von Neumann<\/a> where he essentially describes the P versus NP problem fifteen years before Cook’s seminal paper<\/a>.<\/p>\n

Blogs<\/strong><\/p>\n

Computational Complexity<\/a> (Lance Fortnow and Bill Gasarch)<\/p>\n

G\u00f6del’s Lost Letter and P=NP<\/a> (Dick Lipton and Ken Regan)<\/p>\n

Books<\/strong><\/p>\n

Computers and Intractability: A Guide to the Theory of NP-Completeness<\/a>\u00a0by Michael Garey and David Johnson. Despite its age, still the best mathematical introduction and reference book on P versus NP and NP-complete problems.<\/p>\n

P, NP, and NP-Completeness: The Basics of Computational Complexity<\/a>\u00a0by Oded Goldreich. A more technical but still accessible introduction to P versus NP and beyond.<\/p>\n

Quantum Computing since Democritus<\/a> by Scott Aaronson. A fun romp through logic, complexity and \u00a0quantum computing.\u00a0<\/span><\/p>\n

Introduction to the Theory of Computation<\/a> by Michael Sipser. An excellent undergraduate textbook on the basics of theoretical computer science and the P versus NP problem.<\/p>\n

Computational Complexity: A Modern Approach<\/a> by Sanjeev Arora and Boaz Barak. A solid graduate text on P, NP and beyond.<\/p>\n

Clay Mathematics Institute Lecture on P versus NP by Michael Sipser<\/strong><\/p>\n