000			02029nam a22002777a 4500
001			sulbI000464
003			BD-SySUS
005			20160522173124.0
008			160522s2013 njuab b 001 0 eng d
020			_a9780691156491 (hardback : alk. paper)
040			_aDLC _beng _cDLC _erda _dDLC _dBD-SySUS
042			_apcc
082			_a511.352 _222 _bFOG
100	1		_aFortnow, Lance, _d1963- _924853
245	1	4	_aThe golden ticket : _bP, NP, and the search for the impossible / _cLance Fortnow.
300			_ax, 176 pages : _billustrations, maps ; _c24 cm
504			_aIncludes bibliographical references (pages 165-169) and 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"--
650		0	_aNP-complete problems. _924854
650		0	_aComputer algorithms. _912661
650		7	_aCOMPUTERS / Programming / Algorithms. _2bisacsh _924855
650		7	_aMATHEMATICS / History & Philosophy. _2bisacsh _924856
650		7	_aMATHEMATICS / Linear Programming. _2bisacsh _924857
650		7	_aMATHEMATICS / Mathematical Analysis. _2bisacsh _924858
942			_2ddc _cBK
999			_c60699 _d60699