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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Princeton :
Princeton University Press,
[2013]
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | "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"-- |
| Beschreibung: | 1 online resource (x, 176 pages) : illustrations, maps |
| Bibliographie: | Includes bibliographical references and index. |
| ISBN: | 9781400846610 1400846617 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn828869723 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.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 |d OCLCO |d OCLCL |d EZC |d OCLCO |d HOPLA |d OCLCQ | ||
| 019 | |a 828768663 |a 847124817 |a 979970303 |a 982080299 |a 992013496 |a 995009475 |a 1034938533 |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 | ||
| 035 | |a (OCoLC)828869723 |z (OCoLC)828768663 |z (OCoLC)847124817 |z (OCoLC)979970303 |z (OCoLC)982080299 |z (OCoLC)992013496 |z (OCoLC)995009475 |z (OCoLC)1034938533 |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 | 7 | |a 511.3/52 |2 23 | |
| 084 | |a COM051300 |a MAT015000 |a MAT017000 |a MAT034000 |2 bisacsh | ||
| 049 | |a MAIN | ||
| 100 | 1 | |a Fortnow, Lance, |d 1963- |1 https://id.oclc.org/worldcat/entity/E39PBJwhBxfmXvBW8pfWwrjXBP | |
| 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. | ||
| 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 | 2 | |a Algorithms |0 https://id.nlm.nih.gov/mesh/D000465 | |
| 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 | |
| 650 | 7 | |a NP-complete problems |2 fast | |
| 655 | 7 | |a dissertations. |2 aat | |
| 655 | 7 | |a Academic theses |2 fast | |
| 655 | 7 | |a Academic theses. |2 lcgft |0 http://id.loc.gov/authorities/genreForms/gf2014026039 | |
| 655 | 7 | |a Thèses et écrits académiques. |2 rvmgf | |
| 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 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=518083 |3 Volltext |
| 938 | |a hoopla Digital |b HOPL |n MWT13282068 | ||
| 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 GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn828869723 |
|---|---|
| _version_ | 1816882223814541312 |
| adam_text | |
| any_adam_object | |
| author | Fortnow, Lance, 1963- |
| author_facet | Fortnow, Lance, 1963- |
| author_role | |
| author_sort | Fortnow, Lance, 1963- |
| author_variant | l f lf |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267.7 .F67 2013eb |
| callnumber-search | QA267.7 .F67 2013eb |
| callnumber-sort | QA 3267.7 F67 42013EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | 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. |
| ctrlnum | (OCoLC)828869723 |
| dewey-full | 511.3/52 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/52 |
| dewey-search | 511.3/52 |
| dewey-sort | 3511.3 252 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05750cam a2200889 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn828869723</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">130304s2013 njuab ob 001 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a"> 2012039523</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">YDXCP</subfield><subfield code="d">CDX</subfield><subfield code="d">OCLCO</subfield><subfield code="d">IDEBK</subfield><subfield code="d">E7B</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">MEAUC</subfield><subfield code="d">B24X7</subfield><subfield code="d">JSTOR</subfield><subfield code="d">OCLCF</subfield><subfield code="d">LRU</subfield><subfield code="d">DEBBG</subfield><subfield code="d">P@U</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">TEFOD</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">COCUF</subfield><subfield code="d">K6U</subfield><subfield code="d">ICG</subfield><subfield code="d">LOA</subfield><subfield code="d">LIP</subfield><subfield code="d">PIFAG</subfield><subfield code="d">FVL</subfield><subfield code="d">OTZ</subfield><subfield code="d">MERUC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">ZCU</subfield><subfield code="d">IOG</subfield><subfield code="d">DEGRU</subfield><subfield code="d">U3W</subfield><subfield code="d">EZ9</subfield><subfield code="d">SNK</subfield><subfield code="d">DKU</subfield><subfield code="d">INTCL</subfield><subfield code="d">IGB</subfield><subfield code="d">D6H</subfield><subfield code="d">STF</subfield><subfield code="d">WRM</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">AGLDB</subfield><subfield code="d">KSU</subfield><subfield code="d">INT</subfield><subfield code="d">VT2</subfield><subfield code="d">AU@</subfield><subfield code="d">COO</subfield><subfield code="d">WYU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">G3B</subfield><subfield code="d">LVT</subfield><subfield code="d">UWO</subfield><subfield code="d">S8J</subfield><subfield code="d">S9I</subfield><subfield code="d">TKN</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">LEAUB</subfield><subfield code="d">DKC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OL$</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">INARC</subfield><subfield code="d">VLY</subfield><subfield code="d">MM9</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UKCRE</subfield><subfield code="d">OCLCO</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCO</subfield><subfield code="d">LUU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">EZC</subfield><subfield code="d">OCLCO</subfield><subfield code="d">HOPLA</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">828768663</subfield><subfield code="a">847124817</subfield><subfield code="a">979970303</subfield><subfield code="a">982080299</subfield><subfield code="a">992013496</subfield><subfield code="a">995009475</subfield><subfield code="a">1034938533</subfield><subfield code="a">1037765734</subfield><subfield code="a">1038663543</subfield><subfield code="a">1055365128</subfield><subfield code="a">1058382460</subfield><subfield code="a">1064070614</subfield><subfield code="a">1067218664</subfield><subfield code="a">1111148095</subfield><subfield code="a">1153034990</subfield><subfield code="a">1162406276</subfield><subfield code="a">1298413863</subfield><subfield code="a">1370507275</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400846610</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1400846617</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780691156491</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0691156492</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781299156562</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1299156568</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)828869723</subfield><subfield code="z">(OCoLC)828768663</subfield><subfield code="z">(OCoLC)847124817</subfield><subfield code="z">(OCoLC)979970303</subfield><subfield code="z">(OCoLC)982080299</subfield><subfield code="z">(OCoLC)992013496</subfield><subfield code="z">(OCoLC)995009475</subfield><subfield code="z">(OCoLC)1034938533</subfield><subfield code="z">(OCoLC)1037765734</subfield><subfield code="z">(OCoLC)1038663543</subfield><subfield code="z">(OCoLC)1055365128</subfield><subfield code="z">(OCoLC)1058382460</subfield><subfield code="z">(OCoLC)1064070614</subfield><subfield code="z">(OCoLC)1067218664</subfield><subfield code="z">(OCoLC)1111148095</subfield><subfield code="z">(OCoLC)1153034990</subfield><subfield code="z">(OCoLC)1162406276</subfield><subfield code="z">(OCoLC)1298413863</subfield><subfield code="z">(OCoLC)1370507275</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">446906</subfield><subfield code="b">MIL</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">22573/ctt20s1z3</subfield><subfield code="b">JSTOR</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">38280D8D-00E1-4056-A498-D951F39DB205</subfield><subfield code="b">OverDrive, Inc.</subfield><subfield code="n">http://www.overdrive.com</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA267.7</subfield><subfield code="b">.F67 2013eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">037000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT017000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT042000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT034000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM051300</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT015000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.3/52</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">COM051300</subfield><subfield code="a">MAT015000</subfield><subfield code="a">MAT017000</subfield><subfield code="a">MAT034000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fortnow, Lance,</subfield><subfield code="d">1963-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJwhBxfmXvBW8pfWwrjXBP</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The golden ticket :</subfield><subfield code="b">P, NP, and the search for the impossible /</subfield><subfield code="c">Lance Fortnow.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Princeton :</subfield><subfield code="b">Princeton University Press,</subfield><subfield code="c">[2013]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (x, 176 pages) :</subfield><subfield code="b">illustrations, maps</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="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.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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"--</subfield><subfield code="c">Provided by publisher</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">NP-complete problems.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh88005054</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh91000149</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Algorithms</subfield><subfield code="0">https://id.nlm.nih.gov/mesh/D000465</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Problèmes NP-complets.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Algorithmes.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithms.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Programming</subfield><subfield code="x">Algorithms.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">History & Philosophy.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Linear Programming.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Mathematical Analysis.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Machine Theory.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Linear & Nonlinear Programming.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">NP-complete problems</subfield><subfield code="2">fast</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">dissertations.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Academic theses</subfield><subfield code="2">fast</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Academic theses.</subfield><subfield code="2">lcgft</subfield><subfield code="0">http://id.loc.gov/authorities/genreForms/gf2014026039</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Thèses et écrits académiques.</subfield><subfield code="2">rvmgf</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Fortnow, Lance, 1963-</subfield><subfield code="t">Golden ticket.</subfield><subfield code="d">Princeton : Princeton University Press, [2013]</subfield><subfield code="z">9780691156491</subfield><subfield code="w">(DLC) 2012039523</subfield><subfield code="w">(OCoLC)820123482</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=518083</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">hoopla Digital</subfield><subfield code="b">HOPL</subfield><subfield code="n">MWT13282068</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Books 24x7</subfield><subfield code="b">B247</subfield><subfield code="n">bkb00055775</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Coutts Information Services</subfield><subfield code="b">COUT</subfield><subfield code="n">24763411</subfield><subfield code="c">22.74 GBP</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">De Gruyter</subfield><subfield code="b">DEGR</subfield><subfield code="n">9781400846610</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10658393</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">518083</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">cis24763411</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Internet Archive</subfield><subfield code="b">INAR</subfield><subfield code="n">goldenticketpnps0000fort</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Project MUSE</subfield><subfield code="b">MUSE</subfield><subfield code="n">muse43258</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">9991204</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| genre | dissertations. aat Academic theses fast Academic theses. lcgft http://id.loc.gov/authorities/genreForms/gf2014026039 Thèses et écrits académiques. rvmgf |
| genre_facet | dissertations. Academic theses Academic theses. Thèses et écrits académiques. |
| id | ZDB-4-EBA-ocn828869723 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:25:12Z |
| institution | BVB |
| isbn | 9781400846610 1400846617 |
| language | English |
| lccn | 2012039523 |
| oclc_num | 828869723 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (x, 176 pages) : illustrations, maps |
| psigel | ZDB-4-EBA |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | Princeton University Press, |
| record_format | marc |
| spelling | Fortnow, Lance, 1963- https://id.oclc.org/worldcat/entity/E39PBJwhBxfmXvBW8pfWwrjXBP The golden ticket : P, NP, and the search for the impossible / Lance Fortnow. Princeton : Princeton University Press, [2013] 1 online resource (x, 176 pages) : illustrations, maps text txt rdacontent computer c rdamedia online resource cr rdacarrier Includes bibliographical references and index. 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. "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"-- Provided by publisher Print version record. English. NP-complete problems. http://id.loc.gov/authorities/subjects/sh88005054 Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Algorithms https://id.nlm.nih.gov/mesh/D000465 Problèmes NP-complets. Algorithmes. algorithms. aat COMPUTERS Programming Algorithms. bisacsh MATHEMATICS History & Philosophy. bisacsh MATHEMATICS Linear Programming. bisacsh MATHEMATICS Mathematical Analysis. bisacsh COMPUTERS Machine Theory. bisacsh MATHEMATICS Linear & Nonlinear Programming. bisacsh Computer algorithms fast NP-complete problems fast dissertations. aat Academic theses fast Academic theses. lcgft http://id.loc.gov/authorities/genreForms/gf2014026039 Thèses et écrits académiques. rvmgf Print version: Fortnow, Lance, 1963- Golden ticket. Princeton : Princeton University Press, [2013] 9780691156491 (DLC) 2012039523 (OCoLC)820123482 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=518083 Volltext |
| spellingShingle | Fortnow, Lance, 1963- The golden ticket : P, NP, and the search for the impossible / 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. NP-complete problems. http://id.loc.gov/authorities/subjects/sh88005054 Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Algorithms https://id.nlm.nih.gov/mesh/D000465 Problèmes NP-complets. Algorithmes. algorithms. aat COMPUTERS Programming Algorithms. bisacsh MATHEMATICS History & Philosophy. bisacsh MATHEMATICS Linear Programming. bisacsh MATHEMATICS Mathematical Analysis. bisacsh COMPUTERS Machine Theory. bisacsh MATHEMATICS Linear & Nonlinear Programming. bisacsh Computer algorithms fast NP-complete problems fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh88005054 http://id.loc.gov/authorities/subjects/sh91000149 https://id.nlm.nih.gov/mesh/D000465 http://id.loc.gov/authorities/genreForms/gf2014026039 |
| title | The golden ticket : P, NP, and the search for the impossible / |
| title_auth | The golden ticket : P, NP, and the search for the impossible / |
| title_exact_search | The golden ticket : P, NP, and the search for the impossible / |
| title_full | The golden ticket : P, NP, and the search for the impossible / Lance Fortnow. |
| title_fullStr | The golden ticket : P, NP, and the search for the impossible / Lance Fortnow. |
| title_full_unstemmed | The golden ticket : P, NP, and the search for the impossible / Lance Fortnow. |
| title_short | The golden ticket : |
| title_sort | golden ticket p np and the search for the impossible |
| title_sub | P, NP, and the search for the impossible / |
| topic | NP-complete problems. http://id.loc.gov/authorities/subjects/sh88005054 Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Algorithms https://id.nlm.nih.gov/mesh/D000465 Problèmes NP-complets. Algorithmes. algorithms. aat COMPUTERS Programming Algorithms. bisacsh MATHEMATICS History & Philosophy. bisacsh MATHEMATICS Linear Programming. bisacsh MATHEMATICS Mathematical Analysis. bisacsh COMPUTERS Machine Theory. bisacsh MATHEMATICS Linear & Nonlinear Programming. bisacsh Computer algorithms fast NP-complete problems fast |
| topic_facet | NP-complete problems. Computer algorithms. Algorithms Problèmes NP-complets. Algorithmes. algorithms. COMPUTERS Programming Algorithms. MATHEMATICS History & Philosophy. MATHEMATICS Linear Programming. MATHEMATICS Mathematical Analysis. COMPUTERS Machine Theory. MATHEMATICS Linear & Nonlinear Programming. Computer algorithms NP-complete problems dissertations. Academic theses Academic theses. Thèses et écrits académiques. |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=518083 |
| work_keys_str_mv | AT fortnowlance thegoldenticketpnpandthesearchfortheimpossible AT fortnowlance goldenticketpnpandthesearchfortheimpossible |