The golden ticket P, NP, and the search for the impossible

By: Fortnow, Lance
Material type: TextTextLanguage: English Publisher: Princeton, NJ [u.a.] Princeton Univ. Press 2013Description: X, 176 S. Ill., graph. Darst 24 cmISBN: 9780691156491 (hdb.)Subject(s): NP-complete problems | Computer algorithms | P-vollständiges Problem | NP-vollständiges Problem | œaComputer algorithms | œaNP-complete problemsDDC classification: 511.3/52 | COM051300 | MAT015000 | MAT017000 | MAT034000 LOC classification: QA267.7Other classification: 54.10 | ST 134 | mat Online resources: Inhaltsverzeichnis Inhaltsverzeichnis | Zentralblatt MATH Inhaltstext 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
Book Book Library
511 (Browse shelf) Checked out 02/12/2020 AT-ISTA#000787
Total holds: 0

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.

There are no comments for this item.

to post a comment.

Powered by Koha