000			02202cam a2200337 i 4500
001			17574030
003			IIITD
005			20240406165000.0
008			121227s2013 njuab b 001 0 eng
010			_a 2012039523
020			_a9780691156491
040			_aDLC _beng _cDLC _erda _dDLC
042			_apcc
050	0	0	_aQA267.7 _b.F67 2013
082	0	0	_a511.352 _bFOR-G
100	1		_aFortnow, Lance,
245	1	4	_aThe golden ticket : _bP, NP, and the search for the impossible _cby Lance Fortnow.
260			_aOxford : _bPrinceton University Press, _c1963.
300			_ax, 176 p : _bill. ; _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.
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
906			_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg
942			_2ddc _cBK
999			_c8549 _d8549