Computer and intractability: a guide to the theory of NP-completeness by David S. Johnson, Michael R. Garey

Computer and intractability: a guide to the theory of NP-completeness



Download eBook




Computer and intractability: a guide to the theory of NP-completeness David S. Johnson, Michael R. Garey ebook
Page: 175
ISBN: 0716710447, 9780716710448
Publisher: W.H.Freeman & Co Ltd
Format: djvu


Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979). Ɲ�自维基百科的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 (Series of Books in the Mathematical Sciences). NP-Completeness: Well, I guess Garey and Johnson's Computers and Intractability: A Guide to the Theory of NP-Completeness will be found among the top books in this list. Johnson: Computers and Intractability, a Guide to the Theory of NP-Completeness, W. 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. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. Freeman | 1979 | ISBN: 0716710455 | 340. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness W. Johnson, {it Computers and Intractability: A Guide to the Theory of NP-Completeness,/} ISBN 0-7167-1045-5, W. Solving a system of non-linear modular arithmetic equations is NP-complete. For details, see for example M. And Information Processing: An Introduction (Oxford University Press, New York, 2001) Chap. This concept of NP-Complete gives light to the image that became famous in the book by Garey and Johnson “Computers and Intractability: A Guide to the Theory of NP-Completeness”.