๐”– Scriptorium
โœฆ   LIBER   โœฆ
๐Ÿ“

Computers and Intractability: A Guide to the Theory of NP-Completeness

โœ Scribed by Michael R. Garey, David S. Johnson

Publisher
W. H. Freeman
Year
1979
Tongue
English
Leaves
175
Series
Series of Books in the Mathematical Sciences
Edition
First Edition
Category
Library
โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis

Like new; used less than a week in a semester.

๐Ÿ“œ SIMILAR VOLUMES

Computers and Intractability: A Guide to
๐Ÿ“ Computers and Intractability: A Guide to the Theory of NP-Completeness
โœ M. R. Garey, D. S. Johnson ๐Ÿ“‚ Library ๐Ÿ“… 1979 ๐Ÿ› W. H. Freeman ๐ŸŒ English

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 proble

Computer and intractability: a guide to
๐Ÿ“ Computer and intractability: a guide to the theory of NP-completeness
โœ Garey M.R., Johnson D.S. ๐Ÿ“‚ Library ๐Ÿ“… 1979 ๐ŸŒ English

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 proble

Computers and Intractability: A Guide to
๐Ÿ“ Computers and Intractability: A Guide to the Theory of NP-Completeness
โœ Michael R. Garey, David S. Johnson ๐Ÿ“‚ Library ๐ŸŒ English

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 proble

Computers and Intractability: A Guide to
๐Ÿ“ Computers and Intractability: A Guide to the Theory of NP-completeness
โœ Garey, Michael R. & Johnson, David S. ๐Ÿ“‚ Library ๐Ÿ“… 1979 ๐Ÿ› W. H. Freeman ๐ŸŒ English

Chapters 1 & 2 are an excellent intro to P, NP, NP-complete, and (non)deterministic Turing machines ((N)DTMs). cited in: * Tad Hogg, โ€œ[Adiabatic Quantum Computing for Random Satisfiability Problems](https://isidore.co/misc/Physics%20papers%20and%20books/Zotero/storage/QEVVSZJ4/Hogg%20-%202003%20-%

Computers and Intractability: A Guide to
๐Ÿ“ Computers and Intractability: A Guide to the Theory of NP-completeness
โœ Garey, Michael R. & Johnson, David S. ๐Ÿ“‚ Library ๐Ÿ“… 1979 ๐Ÿ› W. H. Freeman ๐ŸŒ English

Chapters 1 & 2 are an excellent intro to P, NP, NP-complete, and (non)deterministic Turing machines ((N)DTMs). cited in: * Tad Hogg, โ€œ[Adiabatic Quantum Computing for Random Satisfiability Problems](https://isidore.co/misc/Physics%20papers%20and%20books/Zotero/storage/QEVVSZJ4/Hogg%20-%202003%20-%

Computer and intractability: a guide to
๐Ÿ“ Computer and intractability: a guide to the theory of NP-completeness
โœ Michael R. Garey, David S. Johnson ๐Ÿ“‚ Library ๐Ÿ“… 1979 ๐Ÿ› W.H.Freeman & Co Ltd ๐ŸŒ English

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