MARC Record from harvard_bibliographic_metadata

LEADER: 03015cam a2200457 i 4500
001 013777135-5
005 20131206190851.0
008 121227s2013 njuab b 001 0 eng
010 $a 2012039523
020 $a9780691156491 (hardback : alk. paper)
020 $a0691156492 (hardback : alk. paper)
035 $a(PromptCat)99955055605
035 0 $aocn820123482
040 $aDLC$beng$erda$cDLC$dYDX$dYDXCP$dBDX$dBTCTA$dOCLCO$dABG$dBWX$dORX$dUUA$dVP@$dOCLCQ$dOCLCF
042 $apcc
050 00 $aQA267.7$b.F67 2013
082 00 $a511.3/52$223
084 $aCOM051300$aMAT015000$aMAT017000$aMAT034000$2bisacsh
100 1 $aFortnow, Lance,$d1963-$eauthor.
245 14 $aThe Golden ticket :$bP, NP, and the search for the impossible /$cLance Fortnow.
264 1 $aPrinceton, N.J. :$bPrinceton University Press,$c[2013]
264 4 $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 7 $aNP-complete problems.$2fast$0(OCoLC)fst01032101.
650 7 $aComputer algorithms.$2fast$0(OCoLC)fst00872010.
650 0 $aNP-complete problems.
650 0 $aComputer algorithms.
650 7 $aCOMPUTERS$xProgramming$xAlgorithms.$2bisacsh
650 7 $aMATHEMATICS$xHistory & Philosophy.$2bisacsh
650 7 $aMATHEMATICS$xLinear Programming.$2bisacsh
650 7 $aMATHEMATICS$xMathematical Analysis.$2bisacsh
776 08 $iOnline version:$aFortnow, Lance, 1963-$tGolden ticket.$dPrinceton : Princeton University Press, [2013]$z9781400846610$w(OCoLC)828869723
899 $a415_565750
988 $a20130912
906 $0DLC