Computers and Intractability: A Guide to the Theory of NP-completeness 豆 9.6分

资源最后更新于 2020-08-23 08:24:42

作者：M R Garey

出版社：W. H. Freeman

出版日期：1979-01

ISBN：9780716710455

文件格式： pdf

标签： 计算机科学 计算复杂性 计算机 数学 NP CS 算法 TCS

简介· · · · · ·

This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, "I can't find an efficient algorithm, but neither can all these famous people." This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomia...