Computer and intractability: a guide to the theory of NP-completeness David S. Johnson, Michael R. Garey
Publisher: W.H.Freeman & Co Ltd

The work was joint with Mike Garey and David Johnson, who are the authors of the famous book ”Computers and Intractability: A Guide to the Theory of NP-Completeness”. Of Economic Theory 135, 514-532. 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. Freeman, ISBN-10: 0716710455; D. Garey, Michael R., and David S. 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, W. 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. Great Books: Computers and Intractability: A Guide to the Theory of NP-Completeness by Michael R. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness.