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

Johnson (1978), Computers and Intractability: A Guide to the Theory of NP-completeness, New York: W. Computers and Intractability; A Guide to the Theory of NP-Completeness, W.H. Of Economic Theory 135, 514-532. Ņ�中的图论教授，数次向我们讲解“P对NP”的核心，并推荐了名著《GAREY M R, JOHNSON D S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. Computers and Intractability a guide to the theory of NP-completeness. I would encourage you to read "Computers and Intractability: A Guide to the Theory of NP-Completeness" or atleast a chapter in "Introduction to Algorithms - by Cormen, Rivest" to see how reduction actually works. Computers and Intractability: A Guide to the Theory of NP-Completeness [M]. This book has been the very first book on NP-completeness. Freeman, ISBN-10: 0716710455; D. €�Algorithm for Solving Large-scale 0-. First published in 1979, it presents a thorough compendium of NP-complete problems (which was updated in later printings of the book).