Title
Computers and Intractability: A Guide to the Theory of NPCompleteness (Series of Books in the Mathematical Sciences),Used
Delivery time: 8-12 business days (International)
A readable, straightforward guide by two authors with extensive experience in the field. This text shows how to recognize NPcomplete 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.
By changing our most important processes and
products, we have already made a big leap forward. This ranges from the
increased use of more sustainable fibers to the use of more
environmentally friendly printing processes to the development of
efficient waste management in our value chain.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
Shipping & Returns
Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.
Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.
Shipping & Returns
Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.
Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.
Warranty
We provide a 2-year limited warranty, from the date of purchase for all our products.
If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.
This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).
Warranty
We provide a 2-year limited warranty, from the date of purchase for all our products.
If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.
This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).
Secure Payment
Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.
We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.
Secure Payment
Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.
We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.
Related Products
You may also like
Frequently Asked Questions
- Q: What is the main focus of 'Computers and Intractability'? A: The book provides a comprehensive guide to understanding NP-completeness, detailing how to recognize NP-complete problems and offering practical solutions for addressing them.
- Q: Who are the authors of this book? A: The book is authored by Michael R. Garey and David S. Johnson, both of whom have extensive experience in the field of computational complexity.
- Q: Is this book suitable for beginners in computer science? A: Yes, it is written in a readable and straightforward manner, making it accessible for beginners as well as valuable for more advanced students.
- Q: What subjects does this book cover? A: The book covers topics related to algorithm design, computational complexity, operations research, and combinatorial mathematics.
- Q: What is the condition of the book being sold? A: The book is listed as 'Used Book in Good Condition', indicating it may have some signs of wear but is still functional.
- Q: How many pages does this book have? A: The book contains a total of 340 pages.
- Q: What type of binding does this book have? A: This edition of the book is available in paperback binding.
- Q: When was this book published? A: The book was published on January 15, 1979.
- Q: Can this book be used as a textbook? A: Yes, it is suitable as a supplement for courses in relevant subjects and can also serve as a textbook for seminars.
- Q: What edition of the book is being offered? A: This product is the First Edition of 'Computers and Intractability'.