The golden ticket [electronic resource] : P, NP, and the search for the impossible / Lance Fortnow.
"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...
Main Author: | |
---|---|
Language: | English |
Published: |
Princeton :
Princeton University Press,
[2013]
|
Subjects: | |
Online Access: | |
Variant Title: |
The golden ticket: P, NP, and the search for the impossible |
Format: | Electronic eBook |
MARC
LEADER | 00000nam a22000003i 4500 | ||
---|---|---|---|
001 | ebs1837247e | ||
003 | EBZ | ||
006 | m o d |||||| | ||
007 | cr|unu|||||||| | ||
008 | 121227s2013 njuab ob 001 0 eng | ||
020 | |z 9780691156491 | ||
020 | |z 9780691175782 | ||
020 | |a 9781299156562 (online) | ||
020 | |a 9781400846610 (online) | ||
035 | |a (EBZ)ebs1837247e | ||
040 | |a DLC |b eng |d EBZ | ||
042 | |a pcc | ||
050 | 0 | 0 | |a QA267.7 |b .F67 2013 |
100 | 1 | |a Fortnow, Lance, |d 1963- | |
245 | 1 | 4 | |a The golden ticket |h [electronic resource] : |b P, NP, and the search for the impossible / |c Lance Fortnow. |
246 | 2 | |a The golden ticket: P, NP, and the search for the impossible | |
264 | 1 | |a Princeton : |b Princeton University Press, |c [2013] | |
504 | |a Includes bibliographical references (pages 165-169) and index. | ||
520 | |a "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"-- |c Provided by publisher. | ||
650 | 0 | |a NP-complete problems. | |
650 | 0 | |a Computer algorithms. | |
773 | 0 | |t ProQuest Ebook Central - Academic Complete |d ProQuest Info & Learning Co | |
773 | 0 | |t EBSCO eBooks |d EBSCO | |
773 | 0 | |t eBook Academic Collection (EBSCOhost) – North America |d EBSCO | |
776 | 1 | |t The golden ticket |w (DLC)2012039523 | |
856 | 4 | 0 | |y Access Content Online(from ProQuest Ebook Central - Academic Complete) |u https://ezproxy.msu.edu/login?url=https://ebookcentral.proquest.com/lib/michstate-ebooks/detail.action?docID=1105994 |z ProQuest Ebook Central - Academic Complete: 2013 |
856 | 4 | 0 | |y Access Content Online(from EBSCO eBooks) |u https://ezproxy.msu.edu/login?url=https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=518083 |z EBSCO eBooks: 2013 |
856 | 4 | 0 | |y Access Content Online(from eBook Academic Collection (EBSCOhost) – North America) |u https://ezproxy.msu.edu/login?url=https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=e000xna&AN=518083 |z eBook Academic Collection (EBSCOhost) – North America: 2013 |