The Golden Ticket – P, NP, and the Search for the Impossible - Hardcover

Fortnow, Lance

3.6

468 ratings by Goodreads

9780691156491: The Golden Ticket – P, NP, and the Search for the Impossible

Hardcover

ISBN 10: 0691156492 ISBN 13: 9780691156491

Publisher: Princeton University Press, 2013

View all copies of this ISBN edition:

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 quickly solved by computer. 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. Lance Fortnow traces the history and development of P-NP, giving examples 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. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.

"synopsis" may belong to another edition of this title.

Product Description:

HardCover. Pub Date :2013-03-31 Pages: 188 Language: English Publisher: Princeton University Press 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 conduc...

Review:

"You will love this book. It's completely accessible and captures the thrill, potential, and heartbreak of an edgy mathematical problem in terms that nonmathematicians will appreciate. After readingThe Golden Ticket, I sort of hope P isn't NP after all."--Vint Cerf, Internet Pioneer

"The P-NP problem is fundamental to computer science, and indeed all of mathematics. This book presents an engaging exposition of the problem, its history, and importance. In the process, it touches on major topics appearing in university computer science courses, all presented in an amusing style requiring no background in mathematics beyond the ability to solve Sudoku puzzles. I highly recommend it."--Stephen Cook, formulator of the P-NP problem

"This book, written by a world-class master of the field, is a grand tour of the most celebrated and profound unsolved problem in computer science. Fortnow's many ingenious explanations make the mysteries of computational complexity accessible to anyone interested in the fundamental questions: what can be computed and how fast can we compute it?"--John MacCormick, author of Nine Algorithms That Changed the Future

"This book is meticulous. Fortnow has really tracked down the history and background of this important and timely subject. Even complexity theorists will benefit from his fine scholarship. The Golden Ticket is the first of its kind--a book for general readers about complexity theory."--William Gasarch, University of Maryland

"Nobody explains the importance of the P-NP problem better than Fortnow."--William J. Cook, author of In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation

"One of Amazon.com's 2013 Best Science Books"

"One of Choice's Outstanding Academic Titles for 2013"

"Honorable Mention for the 2013 PROSE Award in Popular Science & Mathematics, Association of American Publishers"

"As Fortnow describes. . . P versus NP is 'one of the great open problems in all of mathematics' not only because it is extremely difficult to solve but because it has such obvious practical applications. It is the dream of total ease, of the confidence that there is an efficient way to calculate nearly everything, 'from cures to deadly diseases to the nature of the universe, ' even 'an algorithmic process to recognize greatness.'. . . To postulate that P NP, as Fortnow does, is to allow for a world of mystery, difficulty, and frustration--but also of discovery and inquiry, of pleasures pleasingly delayed."---Alexander Nazaryan, New Yorker

"Fortnow effectively initiates readers into the seductive mystery and importance of P and NP problems."--Publishers Weekly

"About this title" may belong to another edition of this title.