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
Format: djvu
Page: 175
ISBN: 0716710447, 9780716710448
Publisher: W.H.Freeman & Co Ltd


And Information Processing: An Introduction (Oxford University Press, New York, 2001) Chap. First published in 1979, it presents a thorough compendium of NP-complete problems (which was updated in later printings of the book). Handbook of Algorithms and Data Structures. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. 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 351 0716710447,9780716710455,9780716710448,0716710455. Computers and Intractability: A Guide to the. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979). Computers and Intractibility: A Guide to the Theory of NP-Completeness. Computers and Intractability: A Guide to the Theory of NP-Completeness Michael R. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, ISBN-10: 0716710455; D. Freeman, New York, NY, USA, 1979. Ņ�中的图论教授，数次向我们讲解“P对NP”的核心，并推荐了名著《GAREY M R, JOHNSON D S. This book has been the very first book on NP-completeness. ACM Queue, 5:16–21, November 2007. Computers and Intractability: A Guide to the Theory of NP-Completeness [M]. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) Overview. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology.