Mon premier blog

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
Format: djvu
ISBN: 0716710447, 9780716710448
Page: 175
Publisher: W.H.Freeman & Co Ltd

[2] Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. 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”. Computers and Intractability: A Guide to the Theory of NP-completeness (Series of. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). Most of the setbacks within this plan are admitted bask in Garey also Johnson's seminal book Computers as well as Intractability: A Guide to the Theory of NP-Completeness , also are here given indoors the identical course also organization. The electronic version of this article is the complete one and can be found online at: http://www.almob.org/content/2/1/15 Garey M, Johnson D: Computers and Intractability: A Guide to the Theory of NP-Completeness. Computers and Intractability: A Guide to the Theory of Np-Completeness. Computers and Intractability: A Guide to the Theory of NP-completeness (Series of Books in the Mathematical Sciences). Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. Computers and Intractability: A Guide to the Theory of NP-Completeness (W. Freeman & Co., New York, NY, USA. Books, Computers, Sciences, Series, Guide, Theory, Mathematical, Intractability, NPCompleteness.