Wheelers Books
The Golden Ticket: P, NP, and the Search for the Impossible

The Golden Ticket: P, NP, and the Search for the Impossible (Hardback)

By Fortnow, Lance

  • RRP: $69.99
  • $62.99
  • Save $7.00
  • Temporarily out of stock

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 informati... read full description below.

ISBN 9780691156491
Barcode 9780691156491
Published 15 March 2013
Format Hardback
Alternate Format(s) View All (2 other possible title(s) available)
Language English (translated from: English)
Availability
Title is temporarily out of stock

... view full title details below.

Full details for this title

ISBN-13 9780691156491
ISBN-10 0691156492
Stock Available
Status Title is temporarily out of stock
Publisher unlisted
Imprint Princeton University Press
Publication Date 15 March 2013
International Publication Date 31 March 2013
Publication Country United States United States
Format Hardback
Language English
Translated from English
Author(s) By Fortnow, Lance
Category Award Winning
Vector & Tensor Analysis
Optimization
History of Mathematics
Popular Science
Network Security
Number of Pages 192
Dimensions Width: 152mm
Height: 235mm
Spine: 20mm
Weight 425g
Interest Age 16+ years
Reading Age 16+ years
Library of Congress Computer algorithms, MATHEMATICS / History & Philosophy, MATHEMATICS / Mathematical Analysis, COMPUTERS / Programming / Algorithms, MATHEMATICS / Linear Programming
NBS Text Science & Mathematics: Textbooks & Study Guides
ONIX Text General/trade;College/higher education
Dewey Code 511.352
Catalogue Code Not specified

Description of this Book

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.

^ top

Awards, Reviews & Star Ratings

Awards Commended for PROSE Awards: Popular Science & Popular Mathematics 2013 -- Short-listed for Choice Magazine Outstanding Reference/Academic Book Award 2013 -- Short-listed for Choice 's Outstanding Academic Titles for 2013 2013
NZ Review Fortnow effectively initiates readers into the seductive mystery and importance of P and NP problems. Publishers Weekly
UK Review Bertrams Star Rating: 2 stars (out of 5)

^ top

Author's Bio

Lance Fortnow is professor and chair of the School of Computer Science at the Georgia Institute of Technology. He founded and coauthors the Computational Complexity blog.

^ top