Computers and Intractability

Author: Michael R. Garey
Edition:
Binding: Hardcover
ISBN: 0716710447

Computers and Intractability: A Guide to the Theory of NP-completeness (A Series of books in the mathematical sciences)

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. Download Computers and Intractability: A Guide to the Theory of NP-completeness (A Series of books in the mathematical sciences) from rapidshare, mediafire, 4shared. 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. The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; Computers and Intractability does all of those things effectively. In a readable yet mathematically ri Search and find a lot of computer books in many category availabe for free download.

Computers and Intractability Free

Computers and Intractability computer books for free. In a readable yet mathematically ri

Related education books

Modern Graph Theory (Graduate Texts in Mathematics)

An in-depth account of graph theory, written for serious students of mathematics and computer science. It reflects the current state of the subject and emphasises connections with other branches of pure mathematics. Recognising that graph theory is o