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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Princeton :
Princeton University Press,
[2013]
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | JSTOR_ocn828869723 | ||
| 003 | OCoLC | ||
| 005 | 20231005004200.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 130304s2013 njuab ob 001 0 eng d | ||
| 010 | |a 2012039523 | ||
| 040 | |a N$T |b eng |e pn |c N$T |d YDXCP |d CDX |d OCLCO |d IDEBK |d E7B |d DEBSZ |d MEAUC |d B24X7 |d JSTOR |d OCLCF |d LRU |d DEBBG |d P@U |d OCLCQ |d TEFOD |d OCLCQ |d COCUF |d K6U |d ICG |d LOA |d LIP |d PIFAG |d FVL |d OTZ |d MERUC |d OCLCQ |d ZCU |d IOG |d DEGRU |d U3W |d EZ9 |d SNK |d DKU |d INTCL |d IGB |d D6H |d STF |d WRM |d OCLCQ |d VTS |d AGLDB |d KSU |d INT |d VT2 |d AU@ |d COO |d WYU |d OCLCQ |d G3B |d LVT |d UWO |d S8J |d S9I |d TKN |d OCLCQ |d LEAUB |d DKC |d OCLCQ |d OL$ |d OCLCQ |d INARC |d VLY |d MM9 |d OCLCQ |d UKCRE |d OCLCO |d SFB |d OCLCO |d LUU |d OCLCQ | ||
| 019 | |a 828768663 |a 847124817 |a 979970303 |a 982080299 |a 992013496 |a 995009475 |a 1037765734 |a 1038663543 |a 1055365128 |a 1058382460 |a 1064070614 |a 1067218664 |a 1111148095 |a 1153034990 |a 1162406276 |a 1298413863 |a 1370507275 | ||
| 020 | |a 9781400846610 |q (electronic bk.) | ||
| 020 | |a 1400846617 |q (electronic bk.) | ||
| 020 | |z 9780691156491 | ||
| 020 | |z 0691156492 | ||
| 020 | |z 9781299156562 | ||
| 020 | |z 1299156568 | ||
| 029 | 1 | |a AU@ |b 000050606062 | |
| 029 | 1 | |a AU@ |b 000053294232 | |
| 029 | 1 | |a AU@ |b 000059221744 | |
| 029 | 1 | |a AU@ |b 000060547108 | |
| 029 | 1 | |a AU@ |b 000066234166 | |
| 029 | 1 | |a AU@ |b 000066525741 | |
| 029 | 1 | |a AU@ |b 000067108681 | |
| 029 | 1 | |a DEBBG |b BV042693425 | |
| 029 | 1 | |a DEBBG |b BV043154869 | |
| 029 | 1 | |a DEBSZ |b 382944372 | |
| 029 | 1 | |a DEBSZ |b 423197290 | |
| 029 | 1 | |a DEBSZ |b 424605732 | |
| 029 | 1 | |a DEBSZ |b 447047418 | |
| 029 | 1 | |a GBVCP |b 1003725783 | |
| 029 | 1 | |a DKDLA |b 820120-katalog:999930795205765 | |
| 035 | |a (OCoLC)828869723 |z (OCoLC)828768663 |z (OCoLC)847124817 |z (OCoLC)979970303 |z (OCoLC)982080299 |z (OCoLC)992013496 |z (OCoLC)995009475 |z (OCoLC)1037765734 |z (OCoLC)1038663543 |z (OCoLC)1055365128 |z (OCoLC)1058382460 |z (OCoLC)1064070614 |z (OCoLC)1067218664 |z (OCoLC)1111148095 |z (OCoLC)1153034990 |z (OCoLC)1162406276 |z (OCoLC)1298413863 |z (OCoLC)1370507275 | ||
| 037 | |a 446906 |b MIL | ||
| 037 | |a 22573/ctt20s1z3 |b JSTOR | ||
| 037 | |a 38280D8D-00E1-4056-A498-D951F39DB205 |b OverDrive, Inc. |n http://www.overdrive.com | ||
| 050 | 4 | |a QA267.7 |b .F67 2013eb | |
| 072 | 7 | |a COM |x 037000 |2 bisacsh | |
| 072 | 7 | |a MAT017000 |2 bisacsh | |
| 072 | 7 | |a MAT042000 |2 bisacsh | |
| 072 | 7 | |a MAT034000 |2 bisacsh | |
| 072 | 7 | |a COM051300 |2 bisacsh | |
| 072 | 7 | |a MAT015000 |2 bisacsh | |
| 082 | 0 | 4 | |a 511.3/52 |2 23 |
| 084 | |a COM051300 |a MAT015000 |a MAT017000 |a MAT034000 |2 bisacsh | ||
| 049 | |a UAMI | ||
| 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. |
| 260 | |a Princeton : |b Princeton University Press, |c [2013] | ||
| 300 | |a 1 online resource (x, 176 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 | ||
| 504 | |a Includes bibliographical references 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 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 | ||
| 588 | 0 | |a Print version record. | |
| 546 | |a English. | ||
| 590 | |a JSTOR |b Books at JSTOR All Purchased | ||
| 590 | |a JSTOR |b Books at JSTOR Demand Driven Acquisitions (DDA) | ||
| 590 | |a JSTOR |b Books at JSTOR Evidence Based Acquisitions | ||
| 650 | 0 | |a NP-complete problems. | |
| 650 | 0 | |a Computer algorithms. | |
| 650 | 2 | |a Algorithms | |
| 650 | 6 | |a Problèmes NP-complets. | |
| 650 | 6 | |a Algorithmes. | |
| 650 | 7 | |a algorithms. |2 aat | |
| 650 | 7 | |a COMPUTERS |x Programming |x Algorithms. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x History & Philosophy. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Linear Programming. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Mathematical Analysis. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Machine Theory. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Linear & Nonlinear Programming. |2 bisacsh | |
| 650 | 7 | |a Computer algorithms. |2 fast |0 (OCoLC)fst00872010 | |
| 650 | 7 | |a NP-complete problems. |2 fast |0 (OCoLC)fst01032101 | |
| 776 | 0 | 8 | |i Print version: |a Fortnow, Lance, 1963- |t Golden ticket. |d Princeton : Princeton University Press, [2013] |z 9780691156491 |w (DLC) 2012039523 |w (OCoLC)820123482 |
| 856 | 4 | 0 | |u https://jstor.uam.elogim.com/stable/10.2307/j.ctt24hpm0 |z Texto completo |
| 938 | |a Books 24x7 |b B247 |n bkb00055775 | ||
| 938 | |a Coutts Information Services |b COUT |n 24763411 |c 22.74 GBP | ||
| 938 | |a De Gruyter |b DEGR |n 9781400846610 | ||
| 938 | |a ebrary |b EBRY |n ebr10658393 | ||
| 938 | |a EBSCOhost |b EBSC |n 518083 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n cis24763411 | ||
| 938 | |a Internet Archive |b INAR |n goldenticketpnps0000fort | ||
| 938 | |a Project MUSE |b MUSE |n muse43258 | ||
| 938 | |a YBP Library Services |b YANK |n 9991204 | ||
| 994 | |a 92 |b IZTAP | ||