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




Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) by M. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. Computers and Intractability: A Guide to the Theory of Np-Completeness. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 338pp. 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, W.H. Freeman | 1979 | ISBN: 0716710455 | 340. Freeman Company, November 1990. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) Overview. Freeman, New York, NY, USA, 1979. Freeman, ISBN-10: 0716710455; D.

Links:
Complete PCB Design Using OrCAD Capture and PCB Editor book