Mon premier blog

Computer and intractability: a guide to the theory of NP-completeness David S. Johnson, Michael R. Garey
Publisher: W.H.Freeman & Co Ltd

Garey, Michael R., and David S. Handbook of Algorithms and Data Structures. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Ɂ�去の講義で何度も使った、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). ̠�산학 (computer science)라는 학문의 클래식 중에서도 이 말과 딱 어울리는 책이 있다. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979). 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 (Series of. Johnson: 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 Books in the Mathematical Sciences) M. Computers and Intractibility: A Guide to the Theory of NP-Completeness. ˰�로 <>라는 책이다. And Information Processing: An Introduction (Oxford University Press, New York, 2001) Chap. Computers and Intractability; A Guide to the Theory of NP-Completeness . Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.