Computer and intractability: a guide to the theory of NP-completeness pdf free
Par rumph ava le mercredi, janvier 18 2017, 00:26 - 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
[7] Garey M., Johnson D., Computers and Intractability: a Guide to the Theory of NP-Completeness. The electronic version of this article is the complete one and can be found online at: http://www.almob.org/content/2/1/15 Garey M, Johnson D: Computers and Intractability: A Guide to the Theory of NP-Completeness. Garey, Michael R., and David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness W. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Ɲ�自维基百科的NPC问题收集,大多数问题来自：Garey and Johnson's seminal book Computers and Intractability: A Guide to the Theory of NP-Complet ,科学网. Computers and Intractability: A Guide to the Theory of NP-Completeness (W. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Handbook of Algorithms and Data Structures. Computers and Intractability; A Guide to the Theory of NP-Completeness . Freeman | 1979 | ISBN: 0716710455 | 340. Computers and Intractibility: A Guide to the Theory of NP-Completeness. Harary, F., Graph Theory, Addison-Wesley, Reading, MA, 1969. Garey, M.R., and Johnson, D.S., Computers and Intractability : A Guide to the Theory of NP-Completeness, W.H.