Catalog

Holds may take longer to fill due to library closures within the Sage Library System

Record Details

Catalog Search




Book

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

Available copies

  • 4 of 4 copies available at Sage Library System. (Show)
  • 2 of 2 copies available at Umatilla County Public Libraries. (Show)
  • 2 of 2 copies available at Pendleton Public Library.

Current holds

0 current holds with 4 total copies.

Summary:

This book offers a nontechnical introduction to the P-NP problem, the most important open problem in computer science. 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.--Publisher
Location Call Number / Copy Notes Barcode Shelving Location Circulation Modifier Age Hold Protection Active/Create Date Status Due Date
Pendleton Public Library 511.352 F778 (Text) 37801000458412 Adult Non-Fiction Book None 04/18/2014 Available -
Pendleton Public Library 511.352 F778 (Text) 37801000571354 Adult Non-Fiction Book None 04/15/2017 Available -

Record details

  • ISBN: 9780691156491 (hardback : alk. paper)
  • Physical Description: x, 176 pages : illustrations, maps ; 24 cm
  • Publisher: Princeton : Princeton University Press, [2013]

Content descriptions

Bibliography, etc. Note:
Includes bibliographical references (pages 165-169) and index.
Formatted Contents Note:
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 [doesn't equal] NP -- Secrets -- Quantum -- The future.
Summary, etc.:
This book offers a nontechnical introduction to the P-NP problem, the most important open problem in computer science. 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.--Publisher
Subject: NP-complete problems.
Computer algorithms
COMPUTERS / Programming / Algorithms.
MATHEMATICS / History & Philosophy.
MATHEMATICS / Linear Programming.
MATHEMATICS / Mathematical Analysis.

Additional Resources