Title
Computers and Intractability: A Guide to the Theory of NPCompleteness (Series of Books in the Mathematical Sciences),Used
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
Payment Option
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.
⚠️ 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.
- 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'.