You're $50 Away from Free Shipping!
Computers and Intractability: A Guide to NP-Completeness Theory | Mathematical Sciences Book Series | Essential for Computer Science Students and Researchers
Computers and Intractability: A Guide to NP-Completeness Theory | Mathematical Sciences Book Series | Essential for Computer Science Students and Researchers
Computers and Intractability: A Guide to NP-Completeness Theory | Mathematical Sciences Book Series | Essential for Computer Science Students and Researchers
Computers and Intractability: A Guide to NP-Completeness Theory | Mathematical Sciences Book Series | Essential for Computer Science Students and Researchers

Computers and Intractability: A Guide to NP-Completeness Theory | Mathematical Sciences Book Series | Essential for Computer Science Students and Researchers

$52.51 $95.49 -45% OFF

Free shipping on all orders over $50

7-15 days international

28 people viewing this product right now!

30-day free returns

Secure checkout

13745431

Guranteed safe checkout
amex
paypal
discover
mastercard
visa
apple pay

Description

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.

Reviews

******
- Verified Buyer
This small book contains an excellent discussion of problems of computation that have not yet been solved, and might never be, from a rigorous mathematical POV. It's not easy reading, but if you want to understand the limits of computation, you should have this on your shelf and make time to absorb its contents.