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

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. Computers and Intractability: A Guide to the. Solving a system of non-linear modular arithmetic equations is NP-complete. 2Department of Theoretical Physics and Astrophysics, University of Tabriz, Tabriz 51664, Iran. For details, see for example M. Ņ中的图论教授，数次向我们讲解“P对NP”的核心，并推荐了名著《GAREY M R, JOHNSON D S. Johnson: Computers and Intractability, a Guide to the Theory of NP-Completeness, W. Computers and Intractability: A Guide to the Theory of NP-Completeness [M]. Free download ebook Computers and Intractability: A Guide to the Theory of NP-completeness (A Series of books in the mathematical sciences) pdf. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. Ɂ去の講義で何度も使った、Garey & Johnson: ``Computers and Intractability: A Guide to the Theory of NP-Completeness". Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) Overview. ACM Queue, 5:16–21, November 2007. Ɲ自维基百科的NPC问题收集,大多数问题来自：Garey and Johnson's seminal book Computers and Intractability: A Guide to the Theory of NP-Complet ,科学网.