


The Golden Ticket: 
ADDITIONAL REVIEWS: "[This] asyetunsolved problemidentified by mathematicians as the PNP problemraises fundamental questions about just how far society can ride the technological wave triggered by the computer revolution. Fortnow unfolds a fascinating dualtrack story of how this problem first emerged, Western researchers encountering it while trying to maximize computer efficiency, Russian analysts confronting it while puzzling over the persistent need for perebor ('brute force search'). Readers watch as the PNP problem attracts investigators in cryptography, biology, quantum physics, and social networkingand frustrates them all. Fortnow allows nonspecialist readers to glimpse the conceptual difficulties here (try 'nondeterministic polynomial time,' for example). But he mercifully frames his discussion largely in nontechnical terms. Even readers averse to mathematics will share in the intellectual stimulation of pondering a riddle compelling us to ask what we should hope forand fearin replacing human brains with computer algorithms. A provocative reminder of the realworld consequences of a theoretical enigma."Bryce Christensen, Booklist "The definition of this problem is tricky and technical, but in The Golden Ticket, Lance Fortnow cleverly sidesteps the issue with a boileddown version. P is the collection of problems we can solve quickly, NP is the collection of problems we would like to solve. If P = NP, computers can answer all the questions we pose and our world is changed forever. It is an oversimplification, but Fortnow, a computer scientist at Georgia Institute of Technology, Atlanta, knows his stuff and aptly illustrates why NP problems are so important."Jacob Aron, New Scientist "Fortnow's book does a fine job of showing why the tantalizing question is an important one, with implications far beyond just computer science."Rob Hardy, Commercial Dispatch "A great book. . . . [Lance Fortnow] has written precisely the book about P vs. NP that the interested layperson or IT professional wants and needs."Scott Aaronson, ShtetlOptimized blog "[The Golden Ticket] is a book on a technical subject aimed at a general audience. . . . Lance's mix of technical accuracy with evocative story telling works."Michael Trick, Michael Trick's Operations Research Blog "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."Daniel Lemire's Blog "An entertaining discussion of the P versus NP problem."Andrew Binstock, Dr. Dobb's "The Golden Ticket is an extremely accessible and enjoyable treatment of the most important question of theoretical computer science, namely whether P is equal to NP. . . . [I]t is a very pleasant read for those specializing in discrete mathematics, and understandable to anyone with an undergraduate knowledge of mathematics."Choice "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."Michael Trick, INFORMS Journal of Computing "In any case, it is excellent to have a nontechnical book about the P versus NP question. The Golden Ticket offers an inspiring introduction for nontechnical readers to what is surely the most important open problem in computer science."Leslie Ann Goldberg, LMS Newsletter "The Golden Ticket does a good job of explaining a complex concept in terms that a secondaryschool student will understanda hard problem in its own right, even if not quite NP."Physics World "The whole book is fun to read and can be fully appreciated without any knowledge in (theoretical) computer science. Fortnow's efforts to make the difficult material accessible to nonexperts should be commended. . . . The book thus caters to all audiences: from novices with an interest in computational problems to experts with knowledge in theoretical computer science."Andreas Maletti, Zentralblatt MATH ENDORSEMENT: "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 PNP 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 PNP problem "This book, written by a worldclass 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 kinda book for general readers about complexity theory."William Gasarch, University of Maryland "Nobody explains the importance of the PNP problem better than Fortnow."William J. Cook, author of In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation File created: 4/18/2014  
Questions and comments to: webmaster@press.princeton.edu 