Overview
? DoesP=NP. In just ?ve symbols Dick Karp –in 1972–captured one of the deepest and most important questions of all time. When he ?rst wrote his famous paper, I think it’s fair to say he did not know the depth and importance of his question. Now over three decades later, we know P=NP is central to our understanding of compu- tion, it is a very hard problem, and its resolution will have potentially tremendous consequences. This book is a collection of some of the most popular posts from my blog— Godel ¨ Lost Letter andP=NP—which I started in early 2009. The main thrust of the blog, especially when I started, was to explore various aspects of computational complexity around the famousP=NP question. As I published posts I branched out and covered additional material, sometimes a timely event, sometimes a fun idea, sometimes a new result, and sometimes an old result. I have always tried to make the posts readable by a wide audience, and I believe I have succeeded in doing this.
Full Product Details
Author: Richard J. Lipton
Publisher: Springer-Verlag New York Inc.
Imprint: Springer-Verlag New York Inc.
Edition: 2010 ed.
Dimensions:
Width: 15.50cm
, Height: 1.50cm
, Length: 23.50cm
Weight: 1.190kg
ISBN: 9781441971548
ISBN 10: 1441971548
Pages: 239
Publication Date: 01 September 2010
Audience:
Professional and scholarly
,
Professional & Vocational
Format: Hardback
Publisher's Status: Active
Availability: In Print
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.
Reviews
From the reviews: 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)
From the reviews: 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)
Author Information
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.
