The golden ticket : P, NP, and the search for the impossible / Lance Fortnow.
By: Fortnow, Lance.
Material type:
TextDescription: x, 176 pages, USD 26.95 illustrations, maps ; 24 cm.ISBN: 9780691156491 (hardback : alk. paper).Subject(s): NP-complete problems | Computer algorithms | COMPUTERS / Programming / Algorithms | MATHEMATICS / History & Philosophy | MATHEMATICS / Linear Programming | MATHEMATICS / Mathematical AnalysisDDC classification: 511.3/52 Other classification: COM051300 | MAT015000 | MAT017000 | MAT034000 Summary: "The P-NP problem is the most important open problem in computer science, if not all of mathematics. 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. In this informative and entertaining book, Lance Fortnow traces how the problem arose during the Cold War on both sides of the Iron Curtain, and gives examples of the problem 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. But difficulty also has its advantages. Hard problems allow us to safely conduct electronic commerce and maintain privacy in our online lives.The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem"--
| Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
| Book | Chennai Mathematical Institute General Stacks | 511.352 FOR (Browse shelf) | Available | 8820 |
Browsing Chennai Mathematical Institute Shelves , Shelving location: General Stacks Close shelf browser
|
|
|
|
|
|
|
||
| 511.352 ARO Computational complexity : a modern approach / | 511.352 ARO Computational complexity : a modern approach / | 511.352 COP Computability : Turing, Gödel, Church, and beyond / | 511.352 FOR The golden ticket : P, NP, and the search for the impossible / | 511.352 JUK Boolean function complexity : advances and frontiers / | 511.352 KOZ Theory of computation / | 511.352 KOZ Automata and computability / |
Includes bibliographical references (pages 165-169) and index.
"The P-NP problem is the most important open problem in computer science, if not all of mathematics. 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. In this informative and entertaining book, Lance Fortnow traces how the problem arose during the Cold War on both sides of the Iron Curtain, and gives examples of the problem 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. But difficulty also has its advantages. Hard problems allow us to safely conduct electronic commerce and maintain privacy in our online lives.The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem"--