Your shopping cart is empty!
Computers And Intractability: A Guide To The Theory Of NP-Completeness (Series Of Books In The Mathematical Sciences)
Publisher: W H Freeman Co
SKU: DADAX0716710455
ISBN : 9780716710455
Condition : New
SKU: DADAX0716710455
ISBN : 9780716710455
Condition : New
Price:
$128.98
Condition :
Shipping & Tax will be calculated at Checkout.
US Delivery Time: 3-5 Business Days.
Outside US Delivery Time: 8-12 Business Days.
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)
| GENERAL | |
|---|---|
| Author | Michael R. Garey, David S. Johnson |
| Binding | Paperback |
| Language | English |
| Edition | 1St Edition |
| ISBN-10 | 0716710455 |
| ISBN-13 | 9780716710455 |
| Publisher | W. H. Freeman |
| Number Of Pages | 340 |
| Publication Date | 1979-01-15 |
| DIMENSIONS | |
|---|---|
| Height | 9.21 inch. |
| Length | 6.14 inch. |
| Width | 0.74 inch. |
| Weight | 1.1 pounds. |
Write a review
Your Name:
Your Email:
Your Review:
Note: HTML is not translated!
Rating: Bad Good
Enter the code in the box below:
