Computer and intractability: a guide to the theory of NP-completeness ebook download
Par thomas david le mercredi, août 5 2015, 22:56 - Lien permanent
Computer and intractability: a guide to the theory of NP-completeness. David S. Johnson, Michael R. Garey
Computer.and.intractability.a.guide.to.the.theory.of.NP.completeness.pdf
ISBN: 0716710447,9780716710448 | 175 pages | 5 Mb
Computer and intractability: a guide to the theory of NP-completeness David S. Johnson, Michael R. Garey
Publisher: W.H.Freeman & Co Ltd
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) M. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 338pp. Johnson (1978), Computers and Intractability: A Guide to the Theory of NP-completeness, New York: W. Of Economic Theory 135, 514-532. 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. Garey, M.R., and Johnson, D.S., Computers and Intractability : A Guide to the Theory of NP-Completeness, W.H. Harary, F., Graph Theory, Addison-Wesley, Reading, MA, 1969. Freeman Company, November 1990. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences).