The Golden Ticket: P, NP, and the Search for the Impossible - Tapa dura

Acerca del autor

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.

De la contraportada

"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

De la solapa interior

"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 reading The Golden Ticket, I sort of hope P isn't NP after all."--Vint Cerf, Google Vice President and Chief Internet Evangelist and one of the "Fathers of the Internet"

"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 ofNine 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 ofIn Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation