Computer and intractability: a guide to the theory of NP-completeness ebook
Par streeter nathan le mercredi, janvier 25 2017, 07:47 - Lien permanent
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.pdf
ISBN: 0716710447,9780716710448 | 175 pages | 5 Mb
Computer and intractability: a guide to the theory of NP-completeness David S. Johnson, Michael R. Garey
Publisher: W.H.Freeman & Co Ltd
Of Economic Theory 135, 514-532. Freeman, ISBN-10: 0716710455; D. Computer and intractability: a guide to the theory of NP-completeness book download David S. Johnson: 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). Recently, however, in reviewing Rice's Theorem, I was finally able to remember the title: Computers and Intractability: A Guide to the Theory of NP-Completeness, by Michael Garey and David S. Garey, Michael R., and David S. Computers and Intractability – A Guide to the Theory of NP-Completeness. Books, Computers, Sciences, Series, Guide, Theory, Mathematical, Intractability, NPCompleteness. Johnson (1978), Computers and Intractability: A Guide to the Theory of NP-completeness, New York: W. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.