๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computer and intractability: a guide to the theory of NP-completeness

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

Book ID
127424935
Publisher
W.H.Freeman & Co Ltd
Year
1979
Tongue
English
Weight
3 MB
Series
A Series of books in the mathematical sciences
Category
Library
ISBN
0716710447

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

The Mathematics of Logic. A guide to com
The Mathematics of Logic. A guide to completeness theorems and their applications
โœ Richard W. Kaye ๐Ÿ“‚ Library ๐Ÿ“… 2007 ๐Ÿ› Cambridge University Press ๐ŸŒ English โš– 959 KB

This undergraduate textbook covers the key material for a typical first course in logic, in particular presenting a full mathematical account of the most important result in logic, the Completeness Theorem for first-order logic. Looking at a series of interesting systems, increasing in complexity, t

Mathematics of Logic: A Guide to Complet
Mathematics of Logic: A Guide to Completeness Theorems and Their Applications
โœ Kaye L. ๐Ÿ“‚ Library ๐Ÿ“… 2007 ๐Ÿ› Cambridge University Press ๐ŸŒ English โš– 3 MB

This textbook covers the key material for a typical first course in logic for undergraduates or first-year graduate students, in particular, presenting a full mathematical account of the most important result in logic: the Completeness Theorem for first-order logic. Looking at a series of interestin