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. 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, i...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Princeton, NJ :
Princeton University Press,
[2013]
|
| Edición: | Course Book |
| Temas: | |
| Acceso en línea: | Texto completo Texto completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | DEGRUYTERUP_9781400846610 | ||
| 003 | DE-B1597 | ||
| 005 | 20210830012106.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr || |||||||| | ||
| 008 | 210830t20132013nju fo d z eng d | ||
| 019 | |a (OCoLC)979970303 | ||
| 020 | |a 9781400846610 | ||
| 024 | 7 | |a 10.1515/9781400846610 |2 doi | |
| 035 | |a (DE-B1597)453875 | ||
| 035 | |a (OCoLC)828869723 | ||
| 040 | |a DE-B1597 |b eng |c DE-B1597 |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a nju |c US-NJ | ||
| 050 | 4 | |a QA267.7 |b .F67 2018 | |
| 072 | 7 | |a COM051300 |2 bisacsh | |
| 082 | 0 | 4 | |a 511.352 |2 23 |
| 100 | 1 | |a Fortnow, Lance, |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 4 | |a The Golden Ticket : |b P, NP, and the Search for the Impossible / |c Lance Fortnow. |
| 250 | |a Course Book | ||
| 264 | 1 | |a Princeton, NJ : |b Princeton University Press, |c [2013] | |
| 264 | 4 | |c ©2013 | |
| 300 | |a 1 online resource (192 p.) : |b 41 halftones. 41 line illus. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 505 | 0 | 0 | |t Frontmatter -- |t Contents -- |t Preface -- |t Chapter 1 The Golden Ticket -- |t Chapter 2 The Beautiful World -- |t Chapter 3 P and NP -- |t Chapter 4 The Hardest Problems in NP -- |t Chapter 5 The Prehistory of P versus NP -- |t Chapter 6 Dealing with Hardness -- |t Chapter 7 Proving P ≠ NP -- |t Chapter 8 Secrets -- |t Chapter 9 Quantum -- |t Chapter 10 The Future -- |t Acknowledgments -- |t Chapter Notes and Sources -- |t Index |
| 506 | 0 | |a restricted access |u http://purl.org/coar/access_right/c_16ec |f online access with authorization |2 star | |
| 520 | |a 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. | ||
| 538 | |a Mode of access: Internet via World Wide Web. | ||
| 546 | |a In English. | ||
| 588 | 0 | |a Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021) | |
| 650 | 0 | |a Computer algorithms. | |
| 650 | 0 | |a NP-complete problems. | |
| 650 | 7 | |a COMPUTERS / Programming / Algorithms. |2 bisacsh | |
| 653 | |a Facebook. | ||
| 653 | |a Frenemy. | ||
| 653 | |a Hamiltonian paths. | ||
| 653 | |a Internet. | ||
| 653 | |a Ketan Mulmuley. | ||
| 653 | |a Leonid Levin. | ||
| 653 | |a Martin Hellman. | ||
| 653 | |a NP problem. | ||
| 653 | |a NP problems. | ||
| 653 | |a NP-complete problems. | ||
| 653 | |a NP-complete. | ||
| 653 | |a P versus NP problem. | ||
| 653 | |a P versus NP. | ||
| 653 | |a Richard Feynman. | ||
| 653 | |a Steve Cook. | ||
| 653 | |a Twitter. | ||
| 653 | |a Urbana algorithm. | ||
| 653 | |a Whitfield Diffie. | ||
| 653 | |a academic work. | ||
| 653 | |a algebraic geometry. | ||
| 653 | |a algorithm. | ||
| 653 | |a algorithms. | ||
| 653 | |a approximation. | ||
| 653 | |a big data. | ||
| 653 | |a computational problems. | ||
| 653 | |a computer science. | ||
| 653 | |a computers. | ||
| 653 | |a computing. | ||
| 653 | |a cryptography. | ||
| 653 | |a cryptosystem. | ||
| 653 | |a database. | ||
| 653 | |a decryption. | ||
| 653 | |a digital computers. | ||
| 653 | |a efficient algorithms. | ||
| 653 | |a efficient computation. | ||
| 653 | |a encryption. | ||
| 653 | |a factoring. | ||
| 653 | |a fast computers. | ||
| 653 | |a graph isomorphism. | ||
| 653 | |a heuristics. | ||
| 653 | |a linear programming. | ||
| 653 | |a mathematics. | ||
| 653 | |a max-cut. | ||
| 653 | |a network security. | ||
| 653 | |a networking. | ||
| 653 | |a new technologies. | ||
| 653 | |a parallel computation. | ||
| 653 | |a perebor. | ||
| 653 | |a prime numbers. | ||
| 653 | |a problems. | ||
| 653 | |a programming. | ||
| 653 | |a public-key cryptography. | ||
| 653 | |a quantum computers. | ||
| 653 | |a quantum computing. | ||
| 653 | |a quantum cryptography. | ||
| 653 | |a quantum mechanics. | ||
| 653 | |a quantum physical systems. | ||
| 653 | |a research community. | ||
| 653 | |a secret messages. | ||
| 653 | |a social networking data. | ||
| 653 | |a solution. | ||
| 653 | |a teleportation. | ||
| 773 | 0 | 8 | |i Title is part of eBook package: |d De Gruyter |t Princeton University Press eBook-Package Backlist 2000-2013 |z 9783110442502 |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1515/9781400846610 |z Texto completo |
| 856 | 4 | 0 | |u https://degruyter.uam.elogim.com/isbn/9781400846610 |z Texto completo |
| 912 | |a 978-3-11-044250-2 Princeton University Press eBook-Package Backlist 2000-2013 |c 2000 |d 2013 | ||
| 912 | |a EBA_BACKALL | ||
| 912 | |a EBA_CL_CHCOMSGSEN | ||
| 912 | |a EBA_EBACKALL | ||
| 912 | |a EBA_EBKALL | ||
| 912 | |a EBA_ECL_CHCOMSGSEN | ||
| 912 | |a EBA_EEBKALL | ||
| 912 | |a EBA_ESTMALL | ||
| 912 | |a EBA_PPALL | ||
| 912 | |a EBA_STMALL | ||
| 912 | |a GBV-deGruyter-alles | ||
| 912 | |a PDA12STME | ||
| 912 | |a PDA13ENGE | ||
| 912 | |a PDA18STMEE | ||
| 912 | |a PDA5EBK | ||