Computer and intractability: a guide to the theory of NP-completeness pdf free
Par moore wayne le mardi, juillet 11 2017, 12:19 - 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
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). Computer and intractability: a guide to the theory of NP-completeness book download David S. Johnson 351 0716710447,9780716710455,9780716710448,0716710455. 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). Garey, M.R., and Johnson, D.S., Computers and Intractability : A Guide to the Theory of NP-Completeness, W.H. Ɂ�去の講義で何度も使った、Garey & Johnson: ``Computers and Intractability: A Guide to the Theory of NP-Completeness". Computers and Intractability: A Guide to the Theory of NP-Completeness Michael R. Harary, F., Graph Theory, Addison-Wesley, Reading, MA, 1969. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness W. Freeman | 1979 | ISBN: 0716710455 | 340.