東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

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

Fortnow, Lance, (1963-.)

FindBook

Google Book

Amazon

博客來

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

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	The Golden ticket :/ Lance Fortnow.
其他題名:	P, NP, and the search for the impossible /
作者:	Fortnow, Lance,
出版者:	Princeton :Princeton University Press, : 2013.,
面頁冊數:	x, 176 p. :ill., maps ;24 cm.
標題:	NP-complete problems. -
ISBN:	9780691156491 (hbk.) :

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,2013. - x, 176 p. :ill., maps ;24 cm.

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.

ISBN: 9780691156491 (hbk.) :US26.95

LCCN: 2012039523Subjects--Topical Terms:

2051197
NP-complete problems.

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:01772cam a2200241 a 4500 001 1921943
008 140612s2013 njuab b 001 0 eng
010 $a 2012039523
020 $a 9780691156491 (hbk.) : $c US26.95
020 $a 0691156492 (hbk.)
020 $a 9781400846610 (ebk.)
020 $a 1400846617 (ebk.)
020 $a 9781299156562 (ebk.)
020 $a 1299156568 (ebk.)
020 $a 9781400846610 (ebk.)
020 $a 1400846617 (ebk.)
040 $a DLC $b eng
050 0 0 $a QA267.7 $b F67 2013
082 0 0 $a 511.3/52 $2 23
100 1 $a Fortnow, Lance, $d 1963-. $3 2051196
245 1 0 $a The Golden ticket : $b P, NP, and the search for the impossible / $c Lance Fortnow.
260 # $a Princeton : $b Princeton University Press, $c 2013.
300 $a x, 176 p. : $b ill., maps ; $c 24 cm.
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.
650 # 0 $a NP-complete problems. $3 2051197
650 # 0 $a Computer algorithms. $3 523872