Mon premier blog

Computer and intractability: a guide to the theory of NP-completeness David S. Johnson, Michael R. Garey
Publisher: W.H.Freeman & Co Ltd

Ņ�中的图论教授，数次向我们讲解“P对NP”的核心，并推荐了名著《GAREY M R, JOHNSON D S. Computers and Intractability: A Guide to the Theory of NP-Completeness Michael R. Of Economic Theory 135, 514-532. [7] Garey M., Johnson D., Computers and Intractability: a Guide to the Theory of NP-Completeness. It comes from Computers and Intractability—A Guide to the Theory of NP-Completeness by Garey and Johnson, which uses set to express the clauses. 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. Johnson 351 0716710447,9780716710455,9780716710448,0716710455. Computers and Intractability; 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. Computers and Intractability: A Guide to the Theory of NP-Completeness [M]. Garey, Michael R., and David S. Ɲ�自维基百科的NPC问题收集,大多数问题来自：Garey and Johnson's seminal book Computers and Intractability: A Guide to the Theory of NP-Complet ,科学网. 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) M. Johnson (1978), Computers and Intractability: A Guide to the Theory of NP-completeness, New York: W.