
The Golden Ticket: P, Np, and the Search for the Impossible
Kurzinformation



inkl. MwSt. Versandinformationen
Artikel zZt. nicht lieferbar
Artikel zZt. nicht lieferbar

Beschreibung
The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. The Golden Ticket provides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. Lance Fortnow traces the history and development of P-NP, giving examples from a variety of disciplines, including economics, physics, and biology. He explores problems that capture the full difficulty of the P-NP dilemma, from discovering the shortest route through all the rides at Disney World to finding large groups of friends on Facebook. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem. von Fortnow, Lance
Produktdetails

So garantieren wir Dir zu jeder Zeit Premiumqualität.
Über den Autor
Lance Fortnow is professor and chair of the School of Computer Science at Georgia Institute of Technology and the founder and coauthor of the Computational Complexity blog.
- Hardcover
- 260 Seiten
- Erschienen 2011
- ICP
- Kartoniert
- 848 Seiten
- Erschienen 2005
- William Morrow Paperbacks
- Kartoniert
- 364 Seiten
- Erschienen 2006
- Seal Press
- Kartoniert
- 777 Seiten
- Erschienen 1999
- Basic Books
- Taschenbuch
- 224 Seiten
- Erschienen 2001
- Dial Press Trade Paperback
- Hardcover
- 32 Seiten
- Erschienen 2002
- PELICAN PUB CO
- Hardcover
- 300 Seiten
- Erschienen 1971
- Springer
- Taschenbuch
- 424 Seiten
- Erschienen 1998
- Princeton University Press
- Gebunden
- 418 Seiten
- Erschienen 2009
- Springer
- hardcover
- 420 Seiten
- Erschienen 1999
- Springer