 | GetTextbooks.co.uk Compare Price & Save up to 90% | | |
|
California State University, East Bay - Fall QTR 2012 | ||
Section 01 | ||
 | Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) (1st Edition) by Michael R. Garey, David S. Johnson Paperback, 340 Pages, Published 1979 ISBN-10: 0-7167-1045-5 / 0716710455 ISBN-13: 978-0-7167-1045-5 / 9780716710455 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 | |