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
ISBN: 0716710447, 9780716710448
Page: 175
Format: djvu
Publisher: W.H.Freeman & Co Ltd
˰�로 <>라는 책이다. Garey, Michael R., and David S. Ɂ�去の講義で何度も使った、Garey & Johnson: ``Computers and Intractability: A Guide to the Theory of NP-Completeness". 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). Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). �Algorithm for Solving Large-scale 0-. Computers and Intractability; A Guide to the Theory of NP-Completeness, W.H. [7] Garey M., Johnson D., Computers and Intractability: a Guide to the Theory of NP-Completeness. Computers and Intractability: A Guide to the Theory of Np-Completeness. Computers and Intractability: A Guide to the Theory of NP-completeness (Series of. Computers and Intractability: A Guide to the Theory of NP-Completeness. Great Books: Computers and Intractability: A Guide to the Theory of NP-Completeness by Michael R. Posted on July 9, This entry was posted in Uncategorized and tagged Computers, Guide, Intractability, NPCompleteness, Theory. ̠�산학 (computer science)라는 학문의 클래식 중에서도 이 말과 딱 어울리는 책이 있다.