The P=np Question and Gödel's Lost Letter

2010. Auflage 2010
ISBN: 978-1-4419-7154-8
Verlag: Springer Us

Buch, Englisch, 239 Seiten, Format (B × H): 164 mm x 243 mm, Gewicht: 1190 g

? 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.

Zielgruppe

Professional/practitioner

Autoren/Hrsg.

Lipton, Richard J

Fachgebiete

• Mathematik | Informatik Mathematik Mathematik Allgemein Grundlagen der Mathematik
• Technische Wissenschaften Technik Allgemein Technikgeschichte

Inhaltsverzeichnis

A Prologue.- A Walk In the Snow.- On the P=NP Question.- Algorithms: Tiny Yet Powerful.- Is P=NP Well 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?.- On Integer Factoring.- Factoring and Factorials.- BDD’s.- Factoring and Fermat.- On Mathematics.- A Curious Algorithm.- Edit Distance.- Protocols.- Erd?s and the Quantum Method.- Amplifiers.- Amplifying on the PCR Amplifier.- Mathematical Embarrassments.- Mathematical Diseases.- Mathematical Surprises.- Erratum.

Über Autor(innen)

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.