Computer and intractability: a guide to the theory of NP-completeness by David S. Johnson, Michael R. Garey

Computer and intractability: a guide to the theory of NP-completeness



Download eBook




Computer and intractability: a guide to the theory of NP-completeness David S. Johnson, Michael R. Garey ebook
Publisher: W.H.Freeman & Co Ltd
Page: 175
ISBN: 0716710447, 9780716710448
Format: djvu


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”. Freeman, New York, NY, USA, 1979. Freeman Company, November 1990. Solving a system of non-linear modular arithmetic equations is NP-complete. For details, see for example M. 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, 338pp. The electronic version of this article is the complete one and can be found online at: http://www.almob.org/content/2/1/15 Garey M, Johnson D: Computers and Intractability: A Guide to the Theory of NP-Completeness. Most of the setbacks within this plan are admitted bask in Garey also Johnson's seminal book Computers as well as Intractability: A Guide to the Theory of NP-Completeness , also are here given indoors the identical course also organization. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H.