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


Computer.and.intractability.a.guide.to.the.theory.of.NP.completeness.pdf
ISBN: 0716710447,9780716710448 | 175 pages | 5 Mb


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



Computer and intractability: a guide to the theory of NP-completeness David S. Johnson, Michael R. Garey
Publisher: W.H.Freeman & Co Ltd




Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, New York, NY, USA, 1979. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. Computers and Intractability: A Guide to the Theory of NP-Completeness [M]. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). Computers and Intractability: A Guide to the Theory of NP-completeness (Series of Books in the Mathematical Sciences). Computers and Intractability a guide to the theory of NP-completeness. Computers and Intractability: A Guide to the Theory of NP-completeness (Series of. Ņ�中的图论教授,数次向我们讲解“P对NP”的核心,并推荐了名著《GAREY M R, JOHNSON D S. 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. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of. Freeman, ISBN-10: 0716710455; D. Garey, Michael R., and David S. NP-Completeness: Well, I guess Garey and Johnson's Computers and Intractability: A Guide to the Theory of NP-Completeness will be found among the top books in this list.