Computer and intractability: a guide to the theory of NP-completeness pdf download
Par wright adrian le lundi, juin 12 2017, 03:32 - 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 David S. Johnson, Michael R. Garey ebook
Page: 175
Format: djvu
Publisher: W.H.Freeman & Co Ltd
ISBN: 0716710447, 9780716710448
Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. Computers and Intractability: A Guide to the Theory of NP-completeness (Series of Books in the Mathematical Sciences). Freeman & Co., New York, NY, USA. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Computers and Intractability: A Guide to the Theory of Np-Completeness. Garey, Michael R., and David S. Johnson, {it Computers and Intractability: A Guide to the Theory of NP-Completeness,/} ISBN 0-7167-1045-5, W. [2] Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. This book has been the very first book on NP-completeness. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) M. Computers and Intractability: A Guide to the Theory of NP-completeness (Series of. First published in 1979, it presents a thorough compendium of NP-complete problems (which was updated in later printings of the book). Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) by M.