LEADER 03377nam 2200673 a 450 001 9910452419303321 005 20210514021546.0 010 $a1-4008-4661-7 010 $a1-299-15656-8 024 7 $a10.1515/9781400846610 035 $a(CKB)2550000001001307 035 $a(EBL)1105994 035 $a(OCoLC)828869723 035 $a(SSID)ssj0000822001 035 $a(PQKBManifestationID)11448465 035 $a(PQKBTitleCode)TC0000822001 035 $a(PQKBWorkID)10756188 035 $a(PQKB)11221407 035 $a(MiAaPQ)EBC1105994 035 $a(MdBmJHUP)muse43258 035 $a(DE-B1597)453875 035 $a(OCoLC)979970303 035 $a(DE-B1597)9781400846610 035 $a(PPN)199244928 035 $a(PPN)187961360 035 $a(Au-PeEL)EBL1105994 035 $a(CaPaEBR)ebr10658393 035 $a(CaONFJC)MIL446906 035 $a(EXLCZ)992550000001001307 100 $a20121227d2013 uy 0 101 0 $aeng 135 $aurcn||||||||| 181 $ctxt 182 $cc 183 $acr 200 14$aThe golden ticket$b[electronic resource] $eP, NP, and the search for the impossible /$fLance Fortnow 205 $aCourse Book 210 $aPrinceton $cPrinceton University Press$d2013 215 $a1 online resource (189 p.) 300 $aDescription based upon print version of record. 311 0 $a0-691-17578-0 311 0 $a0-691-15649-2 320 $aIncludes bibliographical references and index. 327 $tFront matter --$tContents --$tPreface --$tChapter 1 The Golden Ticket --$tChapter 2 The Beautiful World --$tChapter 3 P and NP --$tChapter 4 The Hardest Problems in NP --$tChapter 5 The Prehistory of P versus NP --$tChapter 6 Dealing with Hardness --$tChapter 7 Proving P ? NP --$tChapter 8 Secrets --$tChapter 9 Quantum --$tChapter 10 The Future --$tAcknowledgments --$tChapter Notes and Sources --$tIndex 330 $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. 606 $aNP-complete problems 606 $aComputer algorithms 608 $aElectronic books. 615 0$aNP-complete problems. 615 0$aComputer algorithms. 676 $a511.3/52 700 $aFortnow$b Lance$f1963-$01044139 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910452419303321 996 $aThe golden ticket$92469593 997 $aUNINA LEADER 01203nas 2200421 c 450 001 9910894728503321 005 20250513221236.0 035 $a(CKB)3790000000120027 035 $a(DE-599)ZDB2507190-7 035 $a(OCoLC)1184332083 035 $a(OCoLC)645487880 035 $a(DE-101)995588554 035 $a(EXLCZ)993790000000120027 100 $a20090727b19912017 |y | 101 0 $ager 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aHessenbrief$ekommunalpolitische Ideen- und Informationsbörse der KPV 210 31$aWiesbaden$cKPV Informations-, Bildungs- und Beratungswerk$d1991-2017 215 $aOnline-Ressource 300 $aGesehen am 13.06.2019 517 $aHessenbrief 517 3 $aKommunalpolitische Ideen- und Informationsbo?rse der KPV 608 $aZeitschrift$2gnd-content 676 $a050 676 $a320 676 $a340 686 $a3,7$2ssgn 712 02$aKommunalpolitische Vereinigung Hessen$4isb 801 0$b0355 801 1$bDE-101 801 2$b9001 906 $aJOURNAL 912 $a9910894728503321 996 $aHessenbrief$94271217 997 $aUNINA