Cargando…
The Golden Ticket : P, NP, and the Search for the Impossible /
"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 enterta...
| Autor principal: | |
|---|---|
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Princeton :
Princeton University Press,
[2013]
|
| Colección: | Book collections on Project MUSE.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a22000004a 4500 | ||
|---|---|---|---|
| 001 | musev2_36432 | ||
| 003 | MdBmJHUP | ||
| 005 | 20230905043830.0 | ||
| 006 | m o d | ||
| 007 | cr||||||||nn|n | ||
| 008 | 130304s2013 nju o 00 0 eng d | ||
| 010 | |z 2012039523 | ||
| 020 | |a 9781400846610 | ||
| 020 | |z 9780691156491 | ||
| 020 | |z 9780691175782 | ||
| 035 | |a (OCoLC)828869723 | ||
| 040 | |a MdBmJHUP |c MdBmJHUP | ||
| 100 | 1 | |a Fortnow, Lance, |d 1963- | |
| 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] | |
| 264 | 3 | |a Baltimore, Md. : |b Project MUSE, |c 2016 | |
| 264 | 4 | |c ©[2013] | |
| 300 | |a 1 online resource (192 pages): |b illustrations, maps | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 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 NP -- 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 | ||
| 546 | |a English. | ||
| 588 | |a Description based on print version record. | ||
| 650 | 7 | |a NP-complete problems. |2 fast |0 (OCoLC)fst01032101 | |
| 650 | 7 | |a Computer algorithms. |2 fast |0 (OCoLC)fst00872010 | |
| 650 | 7 | |a MATHEMATICS |x Linear & Nonlinear Programming. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Machine Theory. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Mathematical Analysis. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Linear Programming. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x History & Philosophy. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Programming |x Algorithms. |2 bisacsh | |
| 650 | 7 | |a algorithms. |2 aat | |
| 650 | 6 | |a Algorithmes. | |
| 650 | 6 | |a Problemes NP-complets. | |
| 650 | 2 | |a Algorithms | |
| 650 | 0 | |a Computer algorithms. | |
| 650 | 0 | |a NP-complete problems. | |
| 655 | 7 | |a Electronic books. |2 local | |
| 710 | 2 | |a Project Muse. |e distributor | |
| 830 | 0 | |a Book collections on Project MUSE. | |
| 856 | 4 | 0 | |z Texto completo |u https://projectmuse.uam.elogim.com/book/36432/ |
| 945 | |a Project MUSE - Custom Collection | ||
| 945 | |a Project MUSE - Archive Complete Supplement IV | ||