Computer and intractability: a guide to the theory of NP-completeness ebook download
Par pierce deborah le dimanche, septembre 4 2016, 21:11 - 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
This book has been the very first book on NP-completeness. 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) Overview. ELEMENTARY RECURSION THEORY AND ITS APPLICATIONS TO FORMAL SYSTEMS – Saul Kripke. Posted on July 9, This entry was posted in Uncategorized and tagged Computers, Guide, Intractability, NPCompleteness, Theory. Garey, M.R., and Johnson, D.S., Computers and Intractability : A Guide to the Theory of NP-Completeness, W.H. Harary, F., Graph Theory, Addison-Wesley, Reading, MA, 1969. Computers And Intractability A Guide To The Theory Of Np-Completeness – Michael Garey. Computers and Intractability – A Guide to the Theory of NP-Completeness. Computers and Intractability: A Guide to the Theory of NP-Completeness.