Computers And Intractability: A Guide To The Theory Of NP-Completeness (Series Of Books In The Mathematical Sciences)
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
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.
Specifications of Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
|Michael R. Garey, David S. Johnson
|W. H. Freeman
|Number Of Pages
Write a review
Note: HTML is not translated!
Rating: Bad Good
Enter the code in the box below: