Computer and intractability: a guide to the theory of NP-completeness by David S. Johnson, Michael R. Garey
Download eBook
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
This book has been the very first book on NP-completeness. Johnson, {it Computers and Intractability: A Guide to the Theory of NP-Completeness,/} ISBN 0-7167-1045-5, W. Computers and Intractability – A Guide to the Theory of NP-Completeness. Harary, F., Graph Theory, Addison-Wesley, Reading, MA, 1969. ̠�산학 (computer science)라는 학문의 클래식 중에서도 이 말과 딱 어울리는 책이 있다. ˰�로 <>라는 책이다. Sticker-based DNA computing is one of the methods of DNA computing. 2Department of Theoretical Physics and Astrophysics, University of Tabriz, Tabriz 51664, Iran. Garey, M.R., and Johnson, D.S., Computers and Intractability : A Guide to the Theory of NP-Completeness, W.H. First published in 1979, it presents a thorough compendium of NP-complete problems (which was updated in later printings of the book). Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) M. The work was joint with Mike Garey and David Johnson, who are the authors of the famous book ”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. Computers and Intractability: A Guide to the Theory of NP-Completeness (W.