The Golden Ticket: P, NP, and the Search for the Impossible

Lance Fortnow

"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.

ScienceScience · medium confidenceScience81 signalsLlm Classifier: Science -> ScienceOpen Library: History & Philosophy -> HistoryOpen Library: MATHEMATICS / History & Philosophy -> HistoryScience & DiscoveryCold War & Nuclear PoliticsWar & Military Strategy
Experimental book profileGenerated by GPT-5.4 nano · may contain inaccuracies

This is an unverified interpretation of the catalog description, offered as an opt-in discovery experiment—not as bibliographic fact.

  1. 01 Central figures

    None extracted with sufficient confidence.

  2. 02 Central places

    None extracted with sufficient confidence.

  3. 03 Suggested argument

    No argument inferred with sufficient confidence.

  4. 04 Reading orientation

    55 / 100 academic

    Trade / academic crossover

    An estimate of intended readership and scholarly apparatus—not quality or importance.

Confidence percentages are the model's own estimates. Profile confidence: 78%.