The P=NP Question and Gödel’s Lost Letter

Authors: Lipton, Richard J.

  • A cutting-edge discussion of the “P=NP” question
  • ‘This is a much needed treatment of great open-problem computing’: Richard Demillo, Professor, Georgia Institute of Technology
Show all benefits

Buy this book

eBook $89.00
price for USA
  • ISBN 978-1-4419-7155-5
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $119.00
price for USA
  • ISBN 978-1-4419-7154-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $119.00
price for USA
  • ISBN 978-1-4899-9272-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

The P=NP question is one of the great problems of science, which has intrigued computer scientists and mathematicians for decades. Despite the abundant research in theoretical computer science regarding the P=NP question, it has not been solved.

The P=NP Question and Gödel’s Lost Letter covers historical developments (including the Gödel’s Lost letter), the importance of P=NP and the future of P=NP. This guide is also based on a new blog by the author, located at http://rjlipton.wordpress.com. Jin-Yi Cai, a professor in computer science at the University of Wisconsin remarks 'I think it is the single most interesting web blog I have seen on related topics. He has a great insight and wit and beautiful way to see things and explain them.' Richard DeMillo, a professor in computer science at Georgia Tech remarks, 'This is a much needed treatment of great open problem computing.'

The P=NP Question and Gödel’s Lost Letter is designed for advanced level students and researchers in computer science, and mathematics as a secondary text and reference book. Computer programmers, software developers and IT professionals working in the related industry of computer science theory, will also find this guide a valuable asset.

About the authors

Richard Lipton is the Storey Professor of Computer Science at Georgia Institute of Technology. Previously he held faculty positions at Yale University, the University of California at Berkeley, and Princeton University. His research is focused primarily, but not exclusively, on theory of computation. He has made seminal contributions to many areas of computing from software engineering and program testing, to computer security and cryptography, to DNA and molecular computation, and to other areas of computer science. He is a member of The National Academy of Engineering, an ACM Fellow, and a Guggenheim fellow.

Reviews

“This book is a thoroughly enjoyable read because of the great balance between anecdotes, presentations of ‘nice’ problems and algorithms and their solutions and proofs, ‘hard mathematics,’ and musings on how to approach mathematical problems. After having read the book, most readers with a background in complexity theory will most likely be unable to resist immediately working on at least one of the many open problems presented in the book.” (Till Tantau, Mathematical Reviews, October, 2015)

“This book … collects and edits the highlights from Lipton’s ongoing blog, rounded out by cross-references and a useful index and bibliography. … the book offers a different experience and a framed portrait of the state of the art. … Summing Up: Recommended. All levels/libraries.” (D. V. Feldman, Choice, Vol. 48 (9), May, 2011)

“The P=NP question is certainly one of the most important problems in mathematics and computer science (CS). What makes this book unique and delightful is that it gives proper weight to the question rather than the technicalities. Each chapter is based on one of Lipton’s blog posts, and readers can jump from chapter to chapter to find his beautifully written thoughts and insights. … In fact, anyone who is highly motivated by this interesting subject that relates science with reality should read it.” (Hector Zenil, ACM Computing Reviews, March, 2011)

“This book collects some entries of the author’s blog on Gödel’s lost letter and P = NP … . It is an enjoyable and lively introduction to some impressive achievements in the field of complexity theory.” (Thierry Coquand, Zentralblatt MATH, Vol. 1215, 2011)


Table of contents (45 chapters)

Buy this book

eBook $89.00
price for USA
  • ISBN 978-1-4419-7155-5
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $119.00
price for USA
  • ISBN 978-1-4419-7154-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $119.00
price for USA
  • ISBN 978-1-4899-9272-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Bibliographic Information

Bibliographic Information
Book Title
The P=NP Question and Gödel’s Lost Letter
Authors
Copyright
2010
Publisher
Springer US
Copyright Holder
Springer Science+Business Media, LLC
eBook ISBN
978-1-4419-7155-5
DOI
10.1007/978-1-4419-7155-5
Hardcover ISBN
978-1-4419-7154-8
Softcover ISBN
978-1-4899-9272-7
Edition Number
1
Number of Pages
XIII, 239
Topics