Home › Computers & Technology › Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
1 1

Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)

Paperback – January 15, 1979
by Michael R. Garey
$98.02 USD
$98.02 USD
Sale Sold out
Shipping calculated at checkout.
Free Shipping
Secure Checkout
Quality Guaranteed
New In Stock
ISBN-13: 9780716710455 ISBN-10: 0716710455
Publisher
W. H. Freeman
Binding
Paperback
Published
January 15, 1979
Weight
1.2 lbs
Dimensions
23.40×1.90×15.60 cm

About this book

Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) by Michael R. Garey. Paperback edition. ISBN: 9780716710455.

A readable, straightforward guide by two authors with extensive experience in the field. This text shows how to recognize NP-complete problems and offers practical suggestions for dealing with them effectively. It is suitable as a supplement to courses in algorithm design, computational complexity, operations research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity.