## The Golden Ticket: |

"The definition of this problem is tricky and technical, but in "Fortnow's book does a fine job of showing why the tantalizing question is an important one, with implications far beyond just computer science." "A great book. . . . [Lance Fortnow] has written precisely the book about P vs. NP that the interested layperson or IT professional wants and needs." "[ "Thoroughly researched and reviewed. Anyone from a smart high school student to a computer scientist is sure to get a lot of this book. The presentation is beautiful. There are few formulas but lots of facts." "An entertaining discussion of the P versus NP problem." " "The book is accessible and useful for practically anyone from smart high school students to specialists. . . . [P]erhaps the interest sparked by this book will be the 'Golden Ticket' for further accessible work in this area. And perhaps P=NP will start to become as famous as E=mc2." "In any case, it is excellent to have a nontechnical book about the P versus NP question. " "[ "This is a fabulous book for both educators and students at the secondary school level and above. It does not require any particular mathematical knowledge but, rather, the ability to think. Enjoy the world of abstract ideas as you experience an intriguing journey through mathematical thinking." "Fortnow's book provides much of the background and personal information on the main characters involved in this problem--notably Steven Cook, with a cameo appearance by Kurt Gödel--that one does not get in the more technical treatments. There is a lot of information in this book, and the serious computer science student is sure to learn from it."
"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 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." "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?" "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." "Nobody explains the importance of the P-NP problem better than Fortnow."
| |

Questions and comments to: webmaster@press.princeton.edu |