Tools

LEADER 03169cam 2200493 i 4500

001 ssj0000822001;

003 WaSeSS;

005 20190313051101.0;

006 m d ;

007 cr n ;

008 121227s2013 njuab sb 001 0 eng d;

010 a| 2012039523;

020 a| 9780691156491 (hardback : alk. paper);

035 a| (WaSeSS)ssj0000822001;

042 a| pcc;

049 a| EREEa| NEHH;

050 00 a| QA267.7b| .F67 2013;

082 00 a| 511.3/522| 23;

100 1 a| Fortnow, Lance,d| 1963-=| ^A1140394;

245 14 a| The golden ticketh| [electronic resource] :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 pages :b| illustrations, maps ;c| 24 cm;

504 a| Includes bibliographical references (pages 165-169) and index.;

506 a| Available only to authorized users.;

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

538 a| Mode of access: World Wide Web;

650 0 a| NP-complete problems.=| ^A374867;

650 0 a| Computer algorithms.=| ^A285321;

650 7 a| COMPUTERS / Programming / Algorithms.2| bisacsh;

650 7 a| MATHEMATICS / History & Philosophy.2| bisacsh;

650 7 a| MATHEMATICS / Linear Programming.2| bisacsh;

650 7 a| MATHEMATICS / Mathematical Analysis.2| bisacsh;

655 0 a| Electronic books.=| ^A491897;

856 40 z| Full text available from Ebook Central - Academic Completeu| https://ebookcentral.proquest.com/lib/eastcarolina/detail.action?docID=1105994;

949 a| CLICK ON WEB ADDRESSw| ASISh| JOYNER188;

949 a| CLICK ON WEB ADDRESSw| ASISh| HSL77;

949 a| CLICK ON WEB ADDRESSw| ASISh| JMUSIC60;

596 a| 1 3 4;

998 a| 4739637;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 4739637-1001l| JNETm| JOYNERr| Ys| Yt| JNESSBKu| 8/20/2017x| EBOOKz| JERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 4739637-2001l| HSLELECm| HSLr| Ys| Yt| HEBKu| 8/20/2017x| EBOOKz| HERESOURCE;

999 a| CLICK ON WEB ADDRESSw| ASISc| 1i| 4739637-3001l| MNETm| JMUSICr| Ys| Yt| MNESSBKu| 8/20/2017x| EBOOKz| JERESOURCE;

The golden ticket P, NP, and the search for the impossible / Lance Fortnow.

Author/creator	Fortnow, Lance, 1963-
Format	Electronic
Publication Info	Princeton : Princeton University Press, [2013]
Description	x, 176 pages : illustrations, maps ; 24 cm
Supplemental Content	Full text available from Ebook Central - Academic Complete
Subjects	NP-complete problems. Computer algorithms.

Abstract	"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"-- Provided by publisher.
Bibliography note	Includes bibliographical references (pages 165-169) and index.
Access restriction	Available only to authorized users.
Technical details	Mode of access: World Wide Web
Genre/form	Electronic books.
LCCN	2012039523
ISBN	9780691156491 (hardback : alk. paper)

Availability

Library	Location	Call Number	Status	Item Actions
	Electronic Resources	Access Content Online	✔ Available

The golden ticket P, NP, and the search for the impossible / Lance Fortnow.

Click here for more information about this title

Availability