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. Computers and Intractability a guide to the theory of NP-completeness. This book has been the very first book on NP-completeness. First published in 1979, it presents a thorough compendium of NP-complete problems (which was updated in later printings of the book). ̠�산학과 학부의 알고리즘 코스웤의 마지막 단원쯤에 꼭 나오는 이 NP-complete라는 놈의 정확한 정의부터 얘기하면서 시작해볼까 한다. ̠�산학 (computer science)라는 학문의 클래식 중에서도 이 말과 딱 어울리는 책이 있다. ̱� 제목은 "Computers and Intractability: A guide to the theory of NP-completeness"이다. Freeman Company, November 1990. Ɂ�去の講義で何度も使った、Garey & 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 . ˰�로 <>라는 책이다. 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, 338pp. 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. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Ɲ�自维基百科的NPC问题收集,大多数问题来自：Garey and Johnson's seminal book Computers and Intractability: A Guide to the Theory of NP-Complet ,科学网.