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


Computer and intractability: a guide to the theory of NP-completeness book download David S. Freeman | 1979 | ISBN: 0716710455 | 340. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness W. ELEMENTARY RECURSION THEORY AND ITS APPLICATIONS TO FORMAL SYSTEMS – Saul Kripke. Of Economic Theory 135, 514-532. Ɂ�去の講義で何度も使った、Garey & Johnson: ``Computers and Intractability: A Guide to the Theory of NP-Completeness". Johnson, {it Computers and Intractability: A Guide to the Theory of NP-Completeness,/} ISBN 0-7167-1045-5, W. 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. 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”. Garey, M.R., and Johnson, D.S., Computers and Intractability : A Guide to the Theory of NP-Completeness, W.H. Computers And Intractability A Guide To The Theory Of Np-Completeness – Michael Garey. Harary, F., Graph Theory, Addison-Wesley, Reading, MA, 1969. Johnson (1978), Computers and Intractability: A Guide to the Theory of NP-completeness, New York: W.