Mon premier blog

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

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) Overview. Garey MR, Johnson DS: Computers and Intractability: A Guide to the Theory of NP-Completeness. ̠�산학 (computer science)라는 학문의 클래식 중에서도 이 말과 딱 어울리는 책이 있다. Received 2 November 2012; Revised 11 January 2013; Accepted 11 January 2013 NP-complete problems such as knapsack problem and other hard combinatorial problems can be easily solved by DNA computers in a very short period of time comparing to conventional silicon-based computers. Sticker-based DNA computing is one of the methods of DNA computing. 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. Or bi-molecular and if only a single molecular species is used as influx. 2Department of Theoretical Physics and Astrophysics, University of Tabriz, Tabriz 51664, Iran. ˰�로 <>라는 책이다.