Computer and intractability: a guide to the theory of NP-completeness book
Par cobb rebecca le vendredi, janvier 29 2016, 05:26 - 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. [2] Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Freeman Company, November 1990. Books, Computers, Sciences, Series, Guide, Theory, Mathematical, Intractability, NPCompleteness. Freeman & Co., New York, NY, USA. �Algorithm for Solving Large-scale 0-. Computers and Intractability; A Guide to the Theory of NP-Completeness, W.H. Freeman, ISBN-10: 0716710455; D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 338pp. The theory of computation is all about computability and complexity. In other words, it asks what can be Computers and Intractability : A Guide to the Theory of NP-Completeness by M. Great Books: Computers and Intractability: A Guide to the Theory of NP-Completeness by Michael R. 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.