Computer and intractability: a guide to the theory of NP-completeness
Michael R. Garey, David S. Johnson
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 polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.
种类:
年:
1979
出版社:
W.H.Freeman & Co Ltd
语言:
english
页:
175
ISBN 10:
0716710447
ISBN 13:
9780716710448
系列:
A Series of books in the mathematical sciences
文件:
DJVU, 3.07 MB
IPFS:
,
english, 1979