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

First published in 1979, it presents a thorough compendium of NP-complete problems (which was updated in later printings of the book). Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. Computers and Intractability: A Guide to the Theory of NP-completeness. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979). And Information Processing: An Introduction (Oxford University Press, New York, 2001) Chap. 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”. : The bribe received Bags, then transferred 15 thousand roubles to a superior, and 25 has left him. Books, Computers, Sciences, Series, Guide, Theory, Mathematical, Intractability, NPCompleteness. This book has been the very first book on NP-completeness. Computers and Intractability a guide to the theory of NP-completeness.