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

It comes from Computers and Intractability—A Guide to the Theory of NP-Completeness by Garey and Johnson, which uses set to express the clauses. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series Books in Ma. ̠산학과 학부의 알고리즘 코스웤의 마지막 단원쯤에 꼭 나오는 이 NP-complete라는 놈의 정확한 정의부터 얘기하면서 시작해볼까 한다. 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”. Computers and Intractability: A Guide to the Theory of NP-Completeness [M]. Vs mathcal{NP} problem.1 I first learned about this problem taking computer science classes in college, and it all seemed very theoretical at the time. Ņ中的图论教授，数次向我们讲解“P对NP”的核心，并推荐了名著《GAREY M R, JOHNSON D S. Now that I study operations research, the problem is very real. I would encourage you to read "Computers and Intractability: A Guide to the Theory of NP-Completeness" or atleast a chapter in "Introduction to Algorithms - by Cormen, Rivest" to see how reduction actually works. ̱ 제목은 "Computers and Intractability: A guide to the theory of NP-completeness"이다. Operations researchers are often limited Actually, I think the original characterization along these lines appeared in Garey and Johnson, Computers and Intractability: A Guide to NP-Completeness, Freeman (1979).