The book "Computers and Intractability: A Guide to the Theory of NP-Completeness" by D. Johnson and M. Garey is a textbook published by Freeman & Company in 1979. It covers the subject areas of computers, mathematics, programming, and discrete mathematics. This trade paperback book spans 340 pages and is written in English, making it a comprehensive resource for students and professionals in the field of computer science and mathematics. With a detailed exploration of NP-completeness and its implications for computational complexity, this book serves as a valuable reference for those interested in the theory of intractability. Used book in good condition due to some writing/markings inside. Some wear to cover and pages.
eBay