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

Johnson, {it Computers and Intractability: A Guide to the Theory of NP-Completeness,/} ISBN 0-7167-1045-5, W. Or bi-molecular and if only a single molecular species is used as influx. 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. Computers And Intractability A Guide To The Theory Of Np-Completeness – Michael Garey. Computers and Intractability; A Guide to the Theory of NP-Completeness . Freeman, ISBN-10: 0716710455; D. [7] Garey M., Johnson D., 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). Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) by M. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. Computers and Intractibility: A Guide to the Theory of NP-Completeness. Garey MR, Johnson DS: Computers and Intractability: A Guide to the Theory of NP-Completeness. 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. ELEMENTARY RECURSION THEORY AND ITS APPLICATIONS TO FORMAL SYSTEMS – Saul Kripke. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) Overview. Handbook of Algorithms and Data Structures. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Computers and Intractability: A Guide to the Theory of NP-completeness (Series of.