Mon premier blog

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

Posted on July 9, This entry was posted in Uncategorized and tagged Computers, Guide, Intractability, NPCompleteness, Theory. Computers and Intractability: A Guide to the Theory of NP-Completeness [M]. Books, Computers, Sciences, Series, Guide, Theory, Mathematical, Intractability, NPCompleteness. 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. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman | 1979 | ISBN: 0716710455 | 340. Garey, Michael R., and David S. Ņ�中的图论教授，数次向我们讲解“P对NP”的核心，并推荐了名著《GAREY M R, JOHNSON D S. Sticker-based DNA computing is one of the methods of DNA computing. 2Department of Theoretical Physics and Astrophysics, University of Tabriz, Tabriz 51664, Iran. 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. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness.