國立虎尾科技大學 |

Language: English

Back

The golden ticket : = P, NP, and the...

Fortnow, Lance, (1963-)

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

Record Type:	Language materials, printed : Monograph/item
Title/Author:	The golden ticket :/ Lance Fortnow.
Reminder of title:	P, NP, and the search for the impossible /
Author:	Fortnow, Lance,
Published:	Princeton :Princeton University Press, : c2013.,
Description:	x, 176 p. :ill., maps ; : 25 cm.;
Subject:	Computer algorithms. -
ISBN:	9780691156491 (cloth) :

The golden ticket : = P, NP, and the search for the impossible /
Fortnow, Lance,1963-

The golden ticket :P, NP, and the search for the impossible /Lance Fortnow. - Princeton :Princeton University Press,c2013. - x, 176 p. :ill., maps ;25 cm.

Includes bibliographical references (p. 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"--

ISBN: 9780691156491 (cloth) :NT810

LCCN: 2012039523Subjects--Topical Terms:

528448
Computer algorithms.

LC Class. No.: QA267.7 / .F67 2013

Dewey Class. No.: 511.3/52

The golden ticket : = P, NP, and the search for the impossible /
LDR:01720cam a2200217 a 4500 001 789154
005 20140923134456.0
008 141028s2013 njuab b 001 0 eng
010 $a 2012039523
020 $a 9780691156491 (cloth) : $c NT810
035 $a 17574030
040 $a DLC $b eng $c DLC $d DLC
041 0 $a eng
042 $a pcc
050 0 0 $a QA267.7 $b .F67 2013
082 0 0 $a 511.3/52 $2 23
084 $a COM051300 $a MAT015000 $a MAT017000 $a MAT034000 $2 bisacsh
100 1 $a Fortnow, Lance, $d 1963- $3 985284
245 1 4 $a The golden ticket : $b P, NP, and the search for the impossible / $c Lance Fortnow.
260 $a Princeton : $c c2013. $b Princeton University Press,
300 $a x, 176 p. : $b ill., maps ; $c 25 cm.
504 $a Includes bibliographical references (p. 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 Computer algorithms. $3 528448
650 0 $a NP-complete problems. $3 985285