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

By:

Fortnow, Lance

Material type: Text

TextPublication details: Oxford : Princeton University Press, 1963.Description: x, 176 p : ill. ; 24 cmISBN:

9780691156491

Subject(s):

DDC classification:

511.352 FOR-G

LOC classification:

QA267.7 .F67 2013

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)

Holdings
Item type	Current library	Collection	Call number	Status	Notes	Date due	Barcode	Item holds
Books	IIITD Reference	Mathematics	CB 511.352 FOR-G (Browse shelf(Opens below))	Available	DBT Project Grant		012748
Books	IIITD Reference	Mathematics	REF 511.352 FOR-G (Browse shelf(Opens below))	Available			002797

Total holds: 0

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 on this title.

to post a comment.