Computer and intractability: a guide to the theory of NP-completeness download
Par thornton john le samedi, août 20 2016, 05:02 - 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
ISBN: 0716710447, 9780716710448
Publisher: W.H.Freeman & Co Ltd
Format: djvu
Page: 175
Computers and Intractability; A Guide to the Theory of NP-Completeness . Computers And Intractability A Guide To The Theory Of Np-Completeness – Michael Garey. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. Freeman, New York, NY, USA, 1979. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979). 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) Overview. And Information Processing: An Introduction (Oxford University Press, New York, 2001) Chap. Garey, Michael R., and David S. Computers and Intractability a guide to the theory of NP-completeness. ELEMENTARY RECURSION THEORY AND ITS APPLICATIONS TO FORMAL SYSTEMS – Saul Kripke. Freeman, ISBN-10: 0716710455; D.