Find a copy in the library
Finding libraries that hold this item...
Details
| Material Type: | Internet resource |
|---|---|
| Document Type: | Book, Internet Resource |
| All Authors / Contributors: |
Richard J Lipton; Kurt Gödel |
| ISBN: | 9781441971548 1441971548 |
| OCLC Number: | 671868992 |
| Description: | xiii, 239 p. : ill. ; 24 cm. |
| Contents: | Part I. A prologue. -- A walk in the snow -- Part II. On the P=NP question. -- Algorithms: tiny yet powerful -- Is P=NP posed? -- What would you bet? -- What happens when P=NP is resolved? -- NP too big or P too small? -- How to solve P=NP ? -- Why believe P not equal to NP? -- A nightmare about SAT -- Bait and switch -- Who's afraid of natural proofs? -- An approach to P=NP -- Is SAT easy? -- SAT is not too easy -- Ramsey's Theorem and NP -- Can they do that? --Rabin flips a coin -- A proof we all missed -- Barrington gets simple -- Exponential algorithms -- An EXPSPACE lower bound -- Randomness has unbounded power -- Counting cycles and logspace -- Ron Graham gives a talk -- An approximate counting method -- Easy and hard sums -- How to avoid O-Abuse -- How good is the worst case model? -- Savitch's Theorem -- Adaptive sampling and timed adversaries -- On the intersection of finite automata -- Where are the movies? -- Part III. On integer factoring. -- Factoring and factorials -- BDD's -- Factoring and Fermat -- Part IV. On mathematics. -- A curious logorithm -- Edit distance -- Protocols -- Erdos and the Quantum Method -- Amplifiers -- Amplifying on the PCR amplifier -- Mathematical embarrassments -- Mathematical diseases -- Mathematical surprises -- Erratum A. Gödel lost letter. |
| Other Titles: | P equals NP question and Gödel's lost letter |
| Responsibility: | Richard J. Lipton. |
| More information: |
Abstract:
Reviews
Publisher Synopsis
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) "This book collects some entries of the author's blog on Godel'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) Read more...
