The golden ticket P, NP, and the search for the impossible / Lance Fortnow.
Material type: TextPublication details: Princeton : Princeton University Press, (c)2013.Description: 1 online resource (pages cm.)Content type:- text
- computer
- online resource
- 9781400846610
- QA267 .G653 2013
- COPYRIGHT NOT covered - Click this link to request copyright permission: https://lib.ciu.edu/copyright-request-form
Item type | Current library | Collection | Call number | URL | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|
Online Book (LOGIN USING YOUR MY CIU LOGIN AND PASSWORD) | G. Allen Fleece Library ONLINE | Non-fiction | QA267.7 (Browse shelf(Opens below)) | Link to resource | Available | ocn828869723 |
"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"--
Includes bibliographies and index.
COPYRIGHT NOT covered - Click this link to request copyright permission:
There are no comments on this title.