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

Garey, Michael R., and David S. 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”. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) M. Computers and Intractability: A Guide to the Theory of Np-Completeness. And Information Processing: An Introduction (Oxford University Press, New York, 2001) Chap. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979). Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. This book has been the very first book on NP-completeness. First published in 1979, it presents a thorough compendium of NP-complete problems (which was updated in later printings of the book). Computers and Intractability: A Guide to the Theory of NP-Completeness. [2] Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. The electronic version of this article is the complete one and can be found online at: https://www.almob.org/content/2/1/15 Garey M, Johnson D: Computers and Intractability: A Guide to the Theory of NP-Completeness. Posted on July 9, This entry was posted in Uncategorized and tagged Computers, Guide, Intractability, NPCompleteness, Theory. This concept of NP-Complete gives light to the image that became famous in the book by Garey and Johnson “Computers and Intractability: A Guide to the Theory of NP-Completeness”. 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. [7] Garey M., Johnson D., Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman & Co., New York, NY, USA. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Free download ebook Computers and Intractability: A Guide to the Theory of NP-completeness (A Series of books in the mathematical sciences) pdf.