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

̠�산학과 학부의 알고리즘 코스웤의 마지막 단원쯤에 꼭 나오는 이 NP-complete라는 놈의 정확한 정의부터 얘기하면서 시작해볼까 한다. The theory of computation is all about computability and complexity. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. First published in 1979, it presents a thorough compendium of NP-complete problems (which was updated in later printings of the book). Garey, Michael R., and David S. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) Overview. Computers and Intractability: A Guide to the Theory of NP-Completeness Michael R. In other words, it asks what can be Computers and Intractability : A Guide to the Theory of NP-Completeness by M. This book has been the very first book on NP-completeness. Today I'll review the wonderful Computers and Intractability: A Guide to the Theory of NP-Completeness . 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: 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"이다. Johnson 351 0716710447,9780716710455,9780716710448,0716710455.