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


̱� 제목은 "Computers and Intractability: A guide to the theory of NP-completeness"이다. ̠�산학과 학부의 알고리즘 코스웤의 마지막 단원쯤에 꼭 나오는 이 NP-complete라는 놈의 정확한 정의부터 얘기하면서 시작해볼까 한다. : The bribe received Bags, then transferred 15 thousand roubles to a superior, and 25 has left him. 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”. 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. Free download ebook Computers and Intractability: A Guide to the Theory of NP-completeness (A Series of books in the mathematical sciences) pdf. Freeman Company, November 1990. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 338pp. Johnson (1978), Computers and Intractability: A Guide to the Theory of NP-completeness, New York: W. Of Economic Theory 135, 514-532. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences).