Garey, Michael R., and David S. Of Economic Theory 135, 514-532. NP-Completeness: Well, I guess Garey and Johnson's Computers and Intractability: A Guide to the Theory of NP-Completeness will be found among the top books in this list. I would encourage you to read "Computers and Intractability: A Guide to the Theory of NP-Completeness" or atleast a chapter in "Introduction to Algorithms - by Cormen, Rivest" to see how reduction actually works. Freeman & Co., New York, NY, USA. Recently, however, in reviewing Rice's Theorem, I was finally able to remember the title: Computers and Intractability: A Guide to the Theory of NP-Completeness, by Michael Garey and David S. [2] Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. MARKET: An ideal reference for Web programming professionals. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) Overview. Computers and Intractability: A Guide to the Theory of Np-Completeness. Johnson (1978), Computers and Intractability: A Guide to the Theory of NP-completeness, New York: W. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. NET Using C# and Ajax; Visual Studio; Database Access through the Web; Ruby; Rails 2.0; Ajax.