Title
Computers And Intractability: A Guide To The Theory Of Npcompleteness (Series Of Books In The Mathematical Sciences),New
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: How many pages does this book have? A: This book has three hundred forty pages. It provides a comprehensive guide to NP-completeness in computer science.
- Q: What is the binding type of this book? A: The binding type is paperback. This makes it lightweight and easy to handle.
- Q: What are the dimensions of this book? A: The dimensions are six point fourteen inches in length, zero point seventy-five inches in width, and nine point twenty-one inches in height. This size makes it portable for easy reading.
- Q: Who are the authors of this book? A: The authors are Michael R. Garey and David S. Johnson. They have extensive experience in the field of computational complexity.
- Q: What topics are covered in this book? A: This book covers NP-complete problems, algorithm design, and computational complexity. It's suitable for courses in combinatorial mathematics and similar fields.
- Q: Is this book suitable for beginners? A: Yes, this book is suitable for beginners. It provides a straightforward guide that is easy to understand for those new to NP-completeness.
- Q: Can this book be used as a textbook? A: Yes, it can be used as a textbook. It's ideal as a supplement for courses in algorithm design and computational complexity.
- Q: Is there a glossary or index in this book? A: Yes, the book includes an index. This helps readers easily find specific topics related to NP-completeness.
- Q: What kind of illustrations are included in this book? A: There are forty-nine illustrations included. These visuals help clarify complex concepts in computational theory.
- Q: How should this book be stored? A: Store this book in a dry place, away from direct sunlight. This will help preserve its quality and readability.
- Q: Is this book in good condition? A: Yes, it is a used book in good condition. The previous owner maintained it well for continued use.
- Q: What if my book arrives damaged? A: If your book arrives damaged, you should contact the seller for a return or exchange. Most sellers have policies in place for such issues.
- Q: How do I clean this book? A: To clean this book, gently wipe the cover with a soft, dry cloth. Avoid using water or cleaning solutions that might damage the pages.
- Q: Is this book appropriate for academic use? A: Yes, this book is appropriate for academic use. It's widely regarded as a valuable resource in computer science education.
- Q: Does this book include exercises or examples? A: Yes, the book includes examples that illustrate key concepts. These help readers apply what they learn about NP-completeness.