The P-NP problem is the most important open problem in computer science, if t 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 ntechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. Lance Fortw traces the history and development of P-NP, giving examples from a variety of disciplines, including ecomics, 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 cant achieve computationally, describing the benefits and unexpected challenges of this compelling problem.
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.
Commended for PROSE Awards: Popular Science & Popular Mathematics 2013. Shortlisted for Choice Magazine Outstanding Reference/Academic Book Award 2013.