Full name: Computers and Intractability: A Guide to the Theory of NP-Completeness

Authors: M. R. Garey, David S. Johnson Rank: Rating: Original Rating: Pop Rating: Genres/categories: Computer Science, Non Fiction, Science Purchase/reserch links: LibraryThing Goodreads Amazon ISBNs: 9780716710455 0716710455

In computer science, more specifically computational complexity theory, Computers and Intractability: A Guide to the Theory of NP-Completeness is an influential textbook by Michael Garey and David S. Johnson. It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book). The book is now outdated in some respects as it does not cover more recent development such as the PCP theorem. It is nevertheless still in print and is regarded as a classic: in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature. Similar books: Introduction to the Theory of Computation by Michael Sipser Distributed Systems by George Coulouris Pattern Recognition and Machine Learning by Christopher M. Bishop Types and Programming Languages by Benjamin C. Pierce A Discipline of Programming by Edsger W. Dijkstra Computer Architecture by John L. Hennessy Python for Data Analysis by Wes McKinney Think Python by Allen B. Downey Structured Computer Organization by Andrew S. Tanenbaum Introduction to Automata Theory, Languages, and Computation by John E. Hopcroft Computational Complexity by Christos H. Papadimitriou Concrete Mathematics by Ronald L. Graham The Turing Omnibus by A. K. Dewdney The Tinkertoy Computer and Other Machinations by A. K. Dewdney Combinatorial Optimization by Christos H. Papadimitriou The C Programming Language by Brian W. Kernighan Code Complete by Steve McConnell Refactoring by Martin Fowler Effective Java by Joshua Bloch Mastering Regular Expressions by Jeffrey E. F. Friedl