Catalog

Record Details

Catalog Search



The golden ticket : P, NP, and the search for the impossible / Lance Fortnow.

Book Book (2013.)
Description: x, 176 pages : illustrations, maps ; 24 cm.
Publisher: Princeton, N.J. : Princeton University Press, 2013.
7 of 7 copies available at NOBLE (All Libraries).
1 of 1 copy available at Winthrop. (Show preferred library)
0 current holds with 7 total copies.
Library Location Call Number Status Due Date
Winthrop Adult Nonfiction 511.352 For 2013 (Text to Phone) Available -
Endicott College General Collection QA 267.7 .F67 2013 (Text to Phone) Available -
Endicott College General Collection QA 267.7 .F67 2013 (Text to Phone) Available -
Gloucester Adult Nonfiction 511.352/Fortnow (Text to Phone) Available -
Gordon College Stack Level 5 QA 267.7 .F67 2013 (Text to Phone) Available -
Northern Essex - Lawrence Campus Stacks QA267.7 .F67 2013 (Text to Phone) Available -
Salem State University Stacks QA 267.7 .F67 2013 (Text to Phone) Available -

  • ISBN: 9780691156491 (hardcover) :
  • ISBN: 0691156492 (hardcover) :
Bibliography, etc.: Includes bibliographical references (pages [165]-169) and index.
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. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be solved by computer. This book provides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this book, the author 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. This book explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem. -- From book jacket.
Citation: Fortnow, Lance. "The golden ticket : P, NP, and the search for the impossible." Princeton, N.J. : Princeton University Press, 2013.

Additional Resources