Computer and intractability: a guide to the theory of NP-completeness book download
Par wells andrea le dimanche, septembre 18 2016, 06:11 - 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 book
Computer and intractability: a guide to the theory of NP-completeness David S. Johnson, Michael R. Garey ebook
Page: 175
ISBN: 0716710447, 9780716710448
Publisher: W.H.Freeman & Co Ltd
Format: djvu
Computers and Intractibility: A Guide to the Theory of NP-Completeness. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Computers and Intractability a guide to the theory of NP-completeness. Harary, F., Graph Theory, Addison-Wesley, Reading, MA, 1969. 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. Johnson 351 0716710447,9780716710455,9780716710448,0716710455. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness W. Computers and Intractability: A Guide to the Theory of NP-Completeness Michael R. Freeman | 1979 | ISBN: 0716710455 | 340. Handbook of Algorithms and Data Structures.