MARC Record from Library of Congress

LEADER: 02235cam a2200337 i 4500
001 2012039523
003 DLC
005 20131115074649.0
008 121227s2013 njuab b 001 0 eng
010 $a 2012039523
020 $a9780691156491 (hardback : alk. paper)
040 $aDLC$beng$cDLC$erda$dDLC
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-
245 14 $aThe golden ticket :$bP, NP, and the search for the impossible /$cLance Fortnow.
264 1 $aPrinceton :$bPrinceton University Press,$c[2013]
300 $ax, 176 pages :$billustrations, maps ;$c24 cm
336 $atext$2rdacontent
337 $aunmediated$2rdamedia
338 $avolume$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.
650 0 $aNP-complete problems.
650 0 $aComputer algorithms.
650 7 $aCOMPUTERS / Programming / Algorithms.$2bisacsh
650 7 $aMATHEMATICS / History & Philosophy.$2bisacsh
650 7 $aMATHEMATICS / Linear Programming.$2bisacsh
650 7 $aMATHEMATICS / Mathematical Analysis.$2bisacsh