KI-Beratung Beta

Produktbild: The P=NP Question and Gödel's Lost Letter

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

98,99 €

inkl. gesetzl. MwSt.

Beschreibung

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

Beschreibung

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

Rezension

“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)

Produktdetails

Format

PDF

Kopierschutz

Nein

Family Sharing

Nein

Text-to-Speech

Nein

Produktdetails

Format

PDF

Format

eBooks im PDF-Format haben eine festgelegte Seitengröße und eignen sich daher nur bedingt zum Lesen auf einem tolino eReader oder Smartphone. Für den vollen Lesegenuss empfehlen wir Ihnen bei PDF-eBooks die Verwendung eines Tablets oder Computers.

Kopierschutz

Nein

Kopierschutz

Dieses eBook können Sie uneingeschränkt auf allen Geräten der tolino Familie, allen sonstigen eReadern und am PC lesen. Das eBook ist nicht kopiergeschützt und kann ein personalisiertes Wasserzeichen enthalten. Weitere Hinweise zum Lesen von eBooks mit einem personalisierten Wasserzeichen finden Sie unter Hilfe/Downloads.

Family Sharing

Nein

Family Sharing

Mit Family Sharing können Sie eBooks innerhalb Ihrer Familie (max. sechs Mitglieder im gleichen Haushalt) teilen. Sie entscheiden selbst, welches Buch Sie mit welchem Familienmitglied teilen möchten. Auch das parallele Lesen durch verschiedene Familienmitglieder ist durch Family Sharing möglich. Um eBooks zu teilen oder geteilt zu bekommen, muss jedes Familienmitglied ein Konto bei Thalia oder einem anderen tolino-Buchhändler haben. Weitere Informationen finden Sie unter Hilfe/Family-Sharing.

Text-to-Speech

Nein

Text-to-Speech

Bedeutet Ihnen Stimme mehr als Text? Mit der Funktion Text-to-Speech können Sie sich im tolino webReader und in der aktuellen Thalia – Lesen & Hören App das eBook vorlesen lassen. Weitere Informationen finden Sie unter Hilfe/Text-to-Speech.

Erscheinungsdatum

20.08.2010

Verlag Springer New York
Seitenzahl

239 (Printausgabe)

Dateigröße

2090 KB

Sprache

Englisch

EAN

9781441971555

Barrierefreiheit
  • keine Information zur Barrierefreiheit bekannt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

Weitere Artikel finden Sie in

  • Produktbild: The P=NP Question and Gödel's Lost Letter
  • The Problem.- G¿odel's Lost Letter.- Cook's Insight.- Karp Hits Twenty-One.- Nondeterminism.- Why Polynomial Time?.- P=NP and Insider Baseball.- The Knapsack Problem: An Exponential Algorithm.- A Nightmare about P=NP.- The One Page Challenge.- P=NP and Big O Notation.- More Abuse of O-Notation.- Our Problem is More Important Than Your Problem.- The Magic of P 6= NP.- P=NP and the End of Security.- The LBA Problem.- P=NP and The Three Bears.- Bait and Switch: Why Lower Bounds Are So Hard.- The Knapsack Problem: A Lower Bound.- There are Big Circuits Out There.- Knapsack: An Upper Bound.- Hilbert and P=NP.- Are All NP-Complete Problems The Same?.- The Real P=NP Problem.- P=NP in Other Worlds.- P=NP and the Structure of the World.- Do Impossibility Results Matter?.- Circuit Lower Bounds.- The Core of a Problem Who is Afraid of Natural Proofs?.- False Proofs by Famous People.- Cryptography Turned Upside Down Ramsey's Theorem Meets P=NP.- Shooting Down Proofs P=NP.- Where are the Movies?.- P=NP : What are the Odds?.-