Computer and intractability: a guide to the theory of NP-completeness pdf free
Par walker martin le vendredi, juin 16 2017, 21:07 - Lien permanent
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 David S. Johnson, Michael R. Garey ebook
ISBN: 0716710447, 9780716710448
Page: 175
Publisher: W.H.Freeman & Co Ltd
Format: djvu
Computers and Intractability: A Guide to the Theory of Np-Completeness. �Algorithm for Solving Large-scale 0-. 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”. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness W. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979). Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) by M. Garey, Michael R., and David S. And Information Processing: An Introduction (Oxford University Press, New York, 2001) Chap. Computers and Intractability: A Guide to the Theory of NP-Completeness Michael R. Computers and Intractability; A Guide to the Theory of NP-Completeness . Johnson 351 0716710447,9780716710455,9780716710448,0716710455. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Computers and Intractability; A Guide to the Theory of NP-Completeness, W.H. Freeman | 1979 | ISBN: 0716710455 | 340.