Computer and intractability: a guide to the theory of NP-completeness. David S. Johnson, Michael R. Garey

Computer and intractability: a guide to the theory of NP-completeness


Computer.and.intractability.a.guide.to.the.theory.of.NP.completeness.pdf
ISBN: 0716710447,9780716710448 | 175 pages | 5 Mb


Download Computer and intractability: a guide to the theory of NP-completeness



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. : The bribe received Bags, then transferred 15 thousand roubles to a superior, and 25 has left him. Computers and Intractability: A Guide to the Theory of NP-completeness. 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. 2Department of Theoretical Physics and Astrophysics, University of Tabriz, Tabriz 51664, Iran. Handbook of Algorithms and Data Structures. Computers and Intractibility: A Guide to the Theory of NP-Completeness. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Garey, Michael R., and David S. Sticker-based DNA computing is one of the methods of DNA computing.