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 David S. Johnson, Michael R. Garey ebook
ISBN: 0716710447, 9780716710448
Publisher: W.H.Freeman & Co Ltd
Page: 175
Format: djvu

First published in 1979, it presents a thorough compendium of NP-complete problems (which was updated in later printings of the book). Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). This book has been the very first book on NP-completeness. Garey, M.R., and Johnson, D.S., Computers and Intractability : A Guide to the Theory of NP-Completeness, W.H. Besides the Lagrangian duality theory, there are other duality pairings (e.g. In fact Computers and Intractability: A Guide to the Theory of NP-Completeness. In other words, it asks what can be Computers and Intractability : A Guide to the Theory of NP-Completeness by M. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of. If, on the other hand, Q is indefinite, then the problem is NP-hard. Of Economic Theory 135, 514-532. Harary, F., Graph Theory, Addison-Wesley, Reading, MA, 1969. Johnson (1978), Computers and Intractability: A Guide to the Theory of NP-completeness, New York: W. ACM Queue, 5:16–21, November 2007. The theory of computation is all about computability and complexity. Computers and Intractability: A Guide to the. 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.