The golden ticket : P, NP, and the search for the impossible / Lance Fortnow.
"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...
Saved in:
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
Princeton :
Princeton University Press,
[2013]
|
| Subjects: | |
| Physical Description: | x, 176 pages : illustrations, maps ; 24 cm |
| Format: | Book |
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | in00005112460 | ||
| 003 | OCoLC | ||
| 005 | 20220616054221.0 | ||
| 008 | 121227s2013 njuab b 001 0 eng | ||
| 010 | |a 2012039523 | ||
| 020 | |a 9780691156491 (hardback : alk. paper) | ||
| 020 | |a 0691156492 (hardback : alk. paper) | ||
| 035 | |a (CaEvSKY)sky253604362 | ||
| 035 | |a (OCoLC)820123482 | ||
| 040 | |a DLC |b eng |e rda |c DLC |d DLC |d SKYRV |d UtOrBLW | ||
| 042 | |a pcc | ||
| 049 | |a EEMO | ||
| 050 | 0 | 0 | |a QA267.7 |b .F67 2013 |
| 082 | 0 | 0 | |a 511.3/52 |2 23 |
| 100 | 1 | |a Fortnow, Lance, |d 1963- |0 http://id.loc.gov/authorities/names/n2012078791 | |
| 245 | 1 | 4 | |a The golden ticket : |b P, NP, and the search for the impossible / |c Lance Fortnow. |
| 264 | 1 | |a Princeton : |b Princeton University Press, |c [2013] | |
| 300 | |a x, 176 pages : |b illustrations, maps ; |c 24 cm | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a unmediated |b n |2 rdamedia | ||
| 338 | |a volume |b nc |2 rdacarrier | ||
| 504 | |a Includes bibliographical references (pages 165-169) and index. | ||
| 505 | 0 | |a The golden ticket -- The beautiful world -- P and NP -- The hardest problems in NP -- The prehistory of P versus NP -- Dealing with hardness -- Proving P 225}0NP -- Secrets -- Quantum -- The future. | |
| 520 | |a "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"-- |c Provided by publisher. | ||
| 650 | 0 | |a NP-complete problems. |0 http://id.loc.gov/authorities/subjects/sh88005054 | |
| 650 | 0 | |a Computer algorithms. |0 http://id.loc.gov/authorities/subjects/sh91000149 | |
| 650 | 7 | |a COMPUTERS / Programming / Algorithms. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS / History & Philosophy. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS / Linear Programming. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS / Mathematical Analysis. |2 bisacsh | |
| 907 | |y .b99530193 |b 210127 |c 130513 | ||
| 998 | |a mn |b 130802 |c m |d a |e - |f eng |g nju |h 4 |i 2 | ||
| 999 | f | f | |i d11cd7cb-c558-577b-87c8-13b04d2c9e77 |s d66e38ce-51c7-5479-b07e-3863267a9966 |t 0 |
| 952 | f | f | |p Can Circulate |a Michigan State University-Library of Michigan |b Michigan State University |c MSU Main Library |d MSU Main Library |t 0 |e QA267.7 .F67 2013 |h Library of Congress classification |i Printed Material |m 31293007463379 |n 1 |