| Record ID | marc_openlibraries_sanfranciscopubliclibrary/sfpl_chq_2018_12_24_run04.mrc:349168069:3361 |
| Source | marc_openlibraries_sanfranciscopubliclibrary |
| Download Link | /show-records/marc_openlibraries_sanfranciscopubliclibrary/sfpl_chq_2018_12_24_run04.mrc:349168069:3361?format=raw |
LEADER: 03361cam a2200553 i 4500
001 820123482
003 OCoLC
005 20151005111714.0
008 121227s2013 njuab b 001 0 eng
010 $a2012039523
019 $a820118690
020 $a9780691156491$q(hardback : alk. paper)
020 $a0691156492$q(hardback : alk. paper)
020 $a9780691175782
035 $a820123482
035 $a(OCoLC)820123482$z(OCoLC)820118690
037 $bPrinceton Univ Pr, California Princeton Fulfillment Center 1445 Lower Ferry rd, Ewing, NJ, USA, 08618$nSAN 630-639X
040 $aDLC$beng$erda$cDLC$dYDX$dYDXCP$dBDX$dBTCTA$dOCLCO$dABG$dBWX$dORX$dUUA$dVP@$dOCLCQ$dSFR$dUtOrBLW
042 $apcc
049 $aSFRA
050 00 $aQA267.7$b.F67 2013
082 00 $a511.3/52$223
092 $a511.352$bF778g
100 1 $aFortnow, Lance,$d1963-$eauthor.
245 14 $aThe Golden ticket :$bP, NP, and the search for the impossible /$cLance Fortnow.
264 1 $aPrinceton, New Jersey :$bPrinceton University Press,$c[2013]
300 $ax, 176 pages :$billustrations, maps ;$c24 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
338 $avolume$bnc$2rdacarrier
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"--$cProvided by publisher.
504 $aIncludes bibliographical references (pages 165-169) and index.
505 0 $aThe 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.
650 0 $aNP-complete problems.
650 0 $aComputer algorithms.
907 $a.b26520321$b12-20-18$c07-11-13
998 $axbt$b08-08-13$cm$da $e-$feng$gnju$h4$i0
957 00 $aOCLC reclamation of 2017-18
907 $a.b26520321$b08-30-15$c07-11-13
938 $aYBP Library Services$bYANK$n9936977
938 $aBrodart$bBROD$n103735054
938 $aBaker and Taylor$bBTCP$nBK0012492546
938 $aBlackwell Book Service$bBBUS$n9936977
956 $aPre-reclamation 001 value: ocn820123482
980 $a0813 sh
998 $axbt$b08-08-13$cm$da$e-$feng$gnju$h4$i0
994 $aC0$bSFR
999 $yMARS
945 $a511.352$bF778g$d - - $e03-24-2018 12:18$f0$g0$h04-14-18$i31223102577906$j321$0323$k - - $lxbtci$o-$p$26.95$q-$r-$s- $t0$u10$v4$w0$x1$y.i74336496$z08-08-13