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. Freeman & Co., New York, NY, USA. Computers and Intractability: A Guide to the Theory of NP-Completeness. Computers and Intractability: A Guide to the Theory of NP-completeness (Series of. Posted on July 9, This entry was posted in Uncategorized and tagged Computers, Guide, Intractability, NPCompleteness, Theory. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Computers and Intractability: A Guide to the Theory of NP-completeness (Series of Books in the Mathematical Sciences). Freeman, New York, NY, USA, 1979. Computers and Intractability – A Guide to the Theory of NP-Completeness. [2] Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G.