Limit search to available items
Book Cover
Author Fortnow, Lance, 1963-

Title The golden ticket : P, NP, and the search for the impossible / Lance Fortnow
Published Princeton : Princeton University Press, [2013]
Online access available from:
EBSCO eBook Academic Collection    View Resource Record  
Safari O'Reilly books online    View Resource Record  


Description 1 online resource (x, 176 pages) : illustrations, maps
Contents The golden ticket -- The beautiful world -- P and NP -- The hardest problems in NP -- The prehistory of P versus NP -- Dealing with hardness -- Proving P NP -- Secrets -- Quantum -- The future
Summary "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"-- Provided by publisher
Bibliography Includes bibliographical references and index
Notes Print version record
Subject Computer algorithms.
NP-complete problems.
Form Electronic book
ISBN 1400846617 (electronic bk.)
9781400846610 (electronic bk.)