HSPLS site
Login
My List - 0
Help
Search
My Account
Databases
HI Newspaper
eBooks/Audiobooks
Learning
PC Reservation
Reading Program
Basic
Advanced
Power
History
Search:
Title Browse
Author Browse
Subject Browse
Best Seller Browse
Music Title Browse
Video/DVD Title Browse
Journal/Newspaper Title Browse
Serial Title Browse
Series Browse (includes Bestseller List)
General Keyword
Title Keyword
Author Keyword
Subject Keyword
Name Keyword
Series Keyword
Score Title Browse
Talking Book Title Browse
Awards Note Browse
Bib No.
Barcode
Refine Search
> You're searching:
HAWAII STATE PUBLIC LIBRARY SYSTEM
Item Information
Holdings
Summary
More Content
More by this author
Fortnow, Lance, 1963-
Subjects
NP-complete problems.
Computer algorithms.
Browse Catalog
by author:
Fortnow, Lance, 1963-
by title:
The golden ticket : ...
MARC Display
The golden ticket : P, NP, and the search for the impossible / Lance Fortnow.
by
Fortnow, Lance, 1963-
Princeton : Princeton University Press, c2013.
Subjects
NP-complete problems.
Computer algorithms.
ISBN:
9780691175782 (pbk.)
9780691156491 (hardback) :
0691156492 (hardback)
Description:
x, 176 pages : illustrations, maps ; 24 cm
Contents:
The golden ticket -- The beautiful world -- P and NP -- The hardest problems in NP -- The prehistory of P versus NP -- Dealing with hardness -- Proving P ` NP -- Secrets -- Quantum -- The future.
Requests:
0
Summary:
"The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be solved by computer. This book provides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this book, the author 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. This book explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem." -- From book jacket.
Copy/Holding information
Location
Collection
Call No.
Status
Hawaii State Library
Business, Science & Technology
511.352 Fo
Checked In
Add Copy to MyList
Hilo Public Library
Adult Nonfiction
511.352 Fortnow
Checked In
Add Copy to MyList
Nanakuli Public Library
Adult Nonfiction
511.352 Fo
Checked In
Add Copy to MyList
Horizon Information Portal 3.25_9884
© 2001-2013
SirsiDynix
All rights reserved.