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



Download eBook




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 (1978), Computers and Intractability: A Guide to the Theory of NP-completeness, New York: W. And Information Processing: An Introduction (Oxford University Press, New York, 2001) Chap. ELEMENTARY RECURSION THEORY AND ITS APPLICATIONS TO FORMAL SYSTEMS – Saul Kripke. Of Economic Theory 135, 514-532. 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 (Freeman, San Francisco, CA, 1979). 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) M. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. Computer and intractability: a guide to the theory of NP-completeness book download David S. Freeman | 1979 | ISBN: 0716710455 | 340. Free download ebook Computers and Intractability: A Guide to the Theory of NP-completeness (A Series of books in the mathematical sciences) pdf. 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”.