MARC보기
LDR04052cmm uu200697Ka 4500
001000000301976
003OCoLC
00520230519144242
006m o d
007cr cnu---unuuu
008130304s2013 nju ob 001 0 eng d
019 ▼a 828768663
020 ▼a 9781400846610 (electronic bk.)
020 ▼a 1400846617 (electronic bk.)
020 ▼z 9780691156491
020 ▼z 0691156492
020 ▼z 9781299156562
020 ▼z 1299156568
0291 ▼a AU@ ▼b 000050606062
0291 ▼a DEBSZ ▼b 382944372
035 ▼a (OCoLC)828869723
037 ▼a 446906 ▼b MIL
037 ▼a 22573/ctt20s1z3 ▼b JSTOR
040 ▼a N$T ▼c N$T ▼d YDXCP ▼d CDX ▼d OCLCO ▼d IDEBK ▼d E7B ▼d DEBSZ ▼d MEAUC ▼d B24X7 ▼d JSTOR ▼d 248032
049 ▼a K4RA
050 4 ▼a QA267.7 ▼b .F67 2013eb
072 7 ▼a COM ▼x 037000 ▼2 bisacsh
072 7 ▼a MAT017000 ▼2 bisacsh
072 7 ▼a MAT042000 ▼2 bisacsh
072 7 ▼a MAT034000 ▼2 bisacsh
072 7 ▼a COM051300 ▼2 bisacsh
072 7 ▼a MAT015000 ▼2 bisacsh
08204 ▼a 511.3/52 ▼2 23
084 ▼a COM051300 ▼a MAT015000 ▼a MAT017000 ▼a MAT034000 ▼2 bisacsh
1001 ▼a Fortnow, Lance, ▼d 1963-
24514 ▼a The golden ticket ▼h [electronic resource] : ▼b P, NP, and the search for the impossible / ▼c Lance Fortnow.
260 ▼a Princeton : ▼b Princeton University Press, ▼c [2013]
300 ▼a 1 online resource (pages cm.)
504 ▼a Includes bibliographical references and index.
5050 ▼a Cover; Title; Copyright; Dedication; Contents; Chapter 7: Proving P {u2260} NP; Preface; Chapter 1: The Golden Ticket; Chapter 2: The Beautiful World; Chapter 3: P and NP; Chapter 4: The Hardest Problems in NP; Chapter 5: The Prehistory of P versus NP; Chapter 6: Dealing with Hardness; Chapter 8: Secrets; Chapter 9: Quantum; Chapter 10 :The Future; Acknowledgments; Chapter Notes and Sources; Index
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"-- ▼c Provided by publisher.
588 ▼a Description based on print version record.
650 0 ▼a NP-complete problems.
650 0 ▼a Computer algorithms.
650 7 ▼a COMPUTERS / Programming / Algorithms. ▼2 bisacsh
650 7 ▼a MATHEMATICS / History & Philosophy. ▼2 bisacsh
650 7 ▼a MATHEMATICS / Linear Programming. ▼2 bisacsh
650 7 ▼a MATHEMATICS / Mathematical Analysis. ▼2 bisacsh
650 7 ▼a COMPUTERS / Machine Theory. ▼2 bisacsh
650 7 ▼a MATHEMATICS / Linear & Nonlinear Programming. ▼2 bisacsh
655 4 ▼a Electronic books.
77608 ▼i Print version: ▼a Fortnow, Lance, 1963- ▼t Golden ticket. ▼d Princeton : Princeton University Press, [2013] ▼z 9780691156491 ▼w (DLC) 2012039523 ▼w (OCoLC)820123482
85640 ▼3 EBSCOhost ▼u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=518083
938 ▼a EBSCOhost ▼b EBSC ▼n 518083
938 ▼a YBP Library Services ▼b YANK ▼n 9991204
938 ▼a Coutts Information Services ▼b COUT ▼n 24763411 ▼c 22.74 GBP
938 ▼a Ingram Digital eBook Collection ▼b IDEB ▼n cis24763411
938 ▼a ebrary ▼b EBRY ▼n ebr10658393
938 ▼a Books 24x7 ▼b B247 ▼n bkb00055775
990 ▼a 관리자
994 ▼a 92 ▼b K4R