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.
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) free ebook pdf epub
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) book
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) ipod
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.