FEEDBACK Smiley face
Normal view MARC view ISBD view

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

By: Fortnow, Lance 1963-.
Material type: materialTypeLabelBookPublisher: Oxford : Princeton University Press, 1963Description: x, 176 p : illustrations, maps ; 24 cm.ISBN: 9780691156491.Subject(s): NP-complete problems | Computer algorithms | COMPUTERS / Programming / Algorithms | MATHEMATICS / History & Philosophy | MATHEMATICS / Linear Programming | MATHEMATICS / Mathematical AnalysisSummary: "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. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
Books Books IIITD
Reference
Mathematics REF 511.352 FOR-G (Browse shelf) Available 002797
Total holds: 0
Browsing IIITD Shelves , Shelving location: Reference , Collection code: Mathematics Close shelf browser
REF 511.35 ARO-C Computational complexity : REF 511.35 HOP-I Introduction to automata theory, languages, and computation REF 511.352 COP-C Computability : REF 511.352 FOR-G The golden ticket : REF 511.352 GOL-C Computational complexity : REF 511.352 JUK-B Boolean function complexity : REF 511.352 TUR-T Theory of computation

Includes bibliographical references (pages 165-169) and index.

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

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in