Computer and intractability: a guide to the

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
Publisher: W.H.Freeman & Co Ltd
ISBN: 0716710447, 9780716710448
Page: 175
Format: djvu

Sticker-based DNA computing is one of the methods of DNA computing. 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. 2Department of Theoretical Physics and Astrophysics, University of Tabriz, Tabriz 51664, Iran. 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. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness W. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. Of Economic Theory 135, 514-532. Computers and Intractability; A Guide to the Theory of NP-Completeness . Freeman | 1979 | ISBN: 0716710455 | 340. Johnson (1978), Computers and Intractability: A Guide to the Theory of NP-completeness, New York: W. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) Overview. 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. 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.