Authors:
- A cutting edge discussion of the "The P=NP Question"
- This is a much needed treatment of great open problem computing," states Richard Demillo, Professor, Georgia Institute of Technology
- Includes supplementary material: sn.pub/extras
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (45 chapters)
-
Front Matter
-
A Prologue
-
Front Matter
-
-
On the P=NP Question
-
Front Matter
-
About this book
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)
Authors and Affiliations
-
, College of Computing, Georgia Institute of Technology, Atlanta, USA
Richard J. Lipton
About the author
Bibliographic Information
Book Title: The P=NP Question and Gödel’s Lost Letter
Authors: Richard J. Lipton
DOI: https://doi.org/10.1007/978-1-4419-7155-5
Publisher: Springer New York, NY
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Science+Business Media, LLC 2010
Hardcover ISBN: 978-1-4419-7154-8Published: 01 September 2010
Softcover ISBN: 978-1-4899-9272-7Published: 20 October 2014
eBook ISBN: 978-1-4419-7155-5Published: 20 August 2010
Edition Number: 1
Number of Pages: XIII, 239
Topics: Theory of Computation, Mathematics of Computing, History of Computing, Mathematical Logic and Foundations, Algorithm Analysis and Problem Complexity, Algorithms