The
golden ticket
P, NP, and the search for the impossible
Fortnow, Lance
1963-
creator
text
bibliography
nju
Oxford
Princeton University Press
1963
2013
monographic
eng
x, 176 p : illustrations, maps ; 24 cm
"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"--
Lance Fortnow.
Includes bibliographical references (pages 165-169) and index.
NP-complete problems
Computer algorithms
COMPUTERS / Programming / Algorithms
MATHEMATICS / History & Philosophy
MATHEMATICS / Linear Programming
MATHEMATICS / Mathematical Analysis
QA267.7 .F67 2013
511.352 FOR-G
COM051300 MAT015000 MAT017000 MAT034000
9780691156491
2012039523
DLC
121227
20140715173204.0
17574030
eng