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

Garey MR, Johnson DS: Computers and Intractability: A Guide to the Theory of NP-Completeness. This book has been the very first book on NP-completeness. And Information Processing: An Introduction (Oxford University Press, New York, 2001) Chap. As a corollary we show, furthermore, that the detection of autocatalytic species, i.e., types that can only be produced from the influx material when they are present in the initial reaction mixture, is an NP-complete computational problem. In fact Computers and Intractability: A Guide to the Theory of NP-Completeness. If, on the other hand, Q is indefinite, then the problem is NP-hard. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of. Computers and Intractability a guide to the theory of NP-completeness. Besides the Lagrangian duality theory, there are other duality pairings (e.g. Posted on July 9, This entry was posted in Uncategorized and tagged Computers, Guide, Intractability, NPCompleteness, Theory. Or bi-molecular and if only a single molecular species is used as influx. Garey, Michael R., and David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979). Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. 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). [7] Garey M., Johnson D., Computers and Intractability: a Guide to the Theory of NP-Completeness. First published in 1979, it presents a thorough compendium of NP-complete problems (which was updated in later printings of the book). Recently, however, in reviewing Rice's Theorem, I was finally able to remember the title: Computers and Intractability: A Guide to the Theory of NP-Completeness, by Michael Garey and David S. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) M.