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



Download eBook




Computer and intractability: a guide to the theory of NP-completeness David S. Johnson, Michael R. Garey ebook
Format: djvu
Publisher: W.H.Freeman & Co Ltd
Page: 175
ISBN: 0716710447, 9780716710448


Garey, M.R., and Johnson, D.S., Computers and Intractability : A Guide to the Theory of NP-Completeness, W.H. Ɂ�去の講義で何度も使った、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, W.H. Of Economic Theory 135, 514-532. Johnson (1978), Computers and Intractability: A Guide to the Theory of NP-completeness, New York: W. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Harary, F., Graph Theory, Addison-Wesley, Reading, MA, 1969. Freeman, New York, NY, USA, 1979. ̠�산학과 학부의 알고리즘 코스웤의 마지막 단원쯤에 꼭 나오는 이 NP-complete라는 놈의 정확한 정의부터 얘기하면서 시작해볼까 한다. [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"이다. Garey, Michael R., and David S.