𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computers and Intractability: A Guide to the Theory of NP-Completeness.by Michael R. Garey; David S. Johnson

✍ Scribed by Review by: Juris Hartmanis


Book ID
124939175
Publisher
Society for Industrial and Applied Mathematics
Year
1982
Tongue
English
Weight
299 KB
Volume
24
Category
Article
ISSN
0036-1445

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Computer and intractability: a guide to
✍ Michael R. Garey, David S. Johnson πŸ“‚ Library πŸ“… 1979 πŸ› W.H.Freeman & Co Ltd 🌐 English βš– 3 MB

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: i