LEADER 05379nam  2201429 a 450 
001 9910818849503321
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(MdBmJHUP)muse43258
035   $a(DE-B1597)453875
035   $a(OCoLC)979970303
035   $a(DE-B1597)9781400846610
035   $a(Au-PeEL)EBL1105994
035   $a(CaPaEBR)ebr10658393
035   $a(CaONFJC)MIL446906
035   $z(PPN)199244928
035   $a(PPN)187961360
035   $a(FR-PaCSA)88838069
035   $a(MiAaPQ)EBC1105994
035   $a(EXLCZ)992550000001001307
100   $a20121227d2013      uy         0
101 0 $aeng
135   $aurcn|||||||||
181   $ctxt
182   $cc
183   $acr
200 14$aThe golden ticket $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   $a0-691-17578-0 
311   $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
610   $aFacebook.
610   $aFrenemy.
610   $aHamiltonian paths.
610   $aInternet.
610   $aKetan Mulmuley.
610   $aLeonid Levin.
610   $aMartin Hellman.
610   $aNP problem.
610   $aNP problems.
610   $aNP-complete problems.
610   $aNP-complete.
610   $aP versus NP problem.
610   $aP versus NP.
610   $aRichard Feynman.
610   $aSteve Cook.
610   $aTwitter.
610   $aUrbana algorithm.
610   $aWhitfield Diffie.
610   $aacademic work.
610   $aalgebraic geometry.
610   $aalgorithm.
610   $aalgorithms.
610   $aapproximation.
610   $abig data.
610   $acomputational problems.
610   $acomputer science.
610   $acomputers.
610   $acomputing.
610   $acryptography.
610   $acryptosystem.
610   $adatabase.
610   $adecryption.
610   $adigital computers.
610   $aefficient algorithms.
610   $aefficient computation.
610   $aencryption.
610   $afactoring.
610   $afast computers.
610   $agraph isomorphism.
610   $aheuristics.
610   $alinear programming.
610   $amathematics.
610   $amax-cut.
610   $anetwork security.
610   $anetworking.
610   $anew technologies.
610   $aparallel computation.
610   $aperebor.
610   $aprime numbers.
610   $aproblems.
610   $aprogramming.
610   $apublic-key cryptography.
610   $aquantum computers.
610   $aquantum computing.
610   $aquantum cryptography.
610   $aquantum mechanics.
610   $aquantum physical systems.
610   $aresearch community.
610   $asecret messages.
610   $asocial networking data.
610   $asolution.
610   $ateleportation.
615  0$aNP-complete problems.
615  0$aComputer algorithms.
676   $a511.3/52
686   $aCOM051300$aMAT015000$aMAT017000$aMAT034000$2bisacsh
700   $aFortnow$b Lance$f1963-$01648568
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910818849503321
996   $aThe golden ticket$93996808
997   $aUNINA