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

Computers and Intractability: A Guide to the Theory of NP-Completeness (Series Books in Ma. Computers and Intractability: A Guide to the. Computers and Intractability: A Guide to the Theory of Np-Completeness. Garey MR, Johnson DS: Computers and Intractability: A Guide to the Theory of NP-Completeness. Harary, F., Graph Theory, Addison-Wesley, Reading, MA, 1969. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). Garey, M.R., and Johnson, D.S., Computers and Intractability : A Guide to the Theory of NP-Completeness, W.H. 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. 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. Freeman & Co., New York, NY, USA. ACM Queue, 5:16–21, November 2007. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) Overview. [2] Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G.