Computers And Intractability: A Guide To The Theory Of NP-Completeness (Series Of Books In The Mathematical Sciences)

$133.74 New In stock Publisher: W H Freeman Co
SKU: DADAX0716710455
ISBN : 9780716710455
Condition : New
Price:
$133.74
Condition :

Shipping & Tax will be calculated at Checkout.
US Delivery Time: 3-5 Business Days.
Outside US Delivery Time: 8-12 Business Days.

Qty:
   - OR -   

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
AuthorMichael R. Garey, David S. Johnson
BindingPaperback
LanguageEnglish
Edition1St Edition
ISBN-100716710455
ISBN-139780716710455
PublisherW. H. Freeman
Number Of Pages340
Publication Date1979-01-15
DIMENSIONS
Height9.21 inch.
Length6.14 inch.
Width0.74 inch.
Weight1.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: