Springer
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (English, Madhu Sudan)
₹5,425
Inclusive of all applicable taxes. Free shipping on orders above ₹499, else ₹49 flat.
Quantity:
1
Free DeliveryOn orders above ₹499
15-Day ReturnEasy returns
Verified ListingQuality-checked
Available Offers
- 🚚Free Delivery — Free on orders above ₹499, else ₹49 flat
- 💵Cash on Delivery — Pay when your order arrives
- ↩️15-Day Easy Returns — Hassle-free return policy
- 🔒Cash on Delivery — Pay safely when your order arrives
Check Delivery
Specifications
| Publisher | Springer |
| Language | English |
| ISBN-13 | 9783540606154 |
| ISBN-10 | 3540606157 |
| Author | Madhu Sudan |
Product Description
Here on GlowMirror, you'll find Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems filed under Springer -- everything you need to know is covered below.
About the Book
This book is based on the author's PhD thesis which was selected as the winning thesis of the 1993 ACM Doctoral Dissertation Competition. The author improved the presentation and included the progress achieved since the thesis was approved by the University of California at Berkeley. This work is a fascinating piece of theoretical computer science research building on deep results from different areas. It provides new theoretical insights and adv…
ISBN: 9783540606154
Book Insights
What You'll Learn
- ·In-depth exploration of topics covered in Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
- ·Key concepts explained with clarity and practical examples
- ·Insights valuable for anyone studying or working in Springer
Who Should Read This
Advanced students, researchers, and domain experts seeking in-depth knowledge.
Key Highlights
- ·Brand new physical book delivered across India
- ·15-day hassle-free return policy
Frequently Asked Questions
What is the price of Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems?
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems is available at ₹5,425 on GlowMirror.
Does GlowMirror offer free delivery for Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems?
GlowMirror offers free delivery on orders above ₹499. For Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems priced at ₹5,425, you qualify for free shipping.
Is Cash on Delivery available for Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems?
Yes, Cash on Delivery (COD) is available for Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems on GlowMirror across India. Pay conveniently when your order arrives.
What is the return policy for Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems?
GlowMirror offers a 15-day hassle-free return policy for Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems. Returns are free of charge. Contact us at info@glowmirror.in or call +91 99446 78357 to initiate a return.
Is Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems available in English?
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems is available in English on GlowMirror.
Who is the author of Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems?
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems is authored by Madhu Sudan.
Who published Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems?
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems is published by Springer.
How many pages does Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems have?
Page count information for Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems is available in the specifications section of this page.
How long does it take to read Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems?
At an average reading speed of 250 words per minute, reading Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems takes a few hours to a few days depending on reading pace.
What is Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems about?
About the Book
This book is based on the author's PhD thesis which was selected as the winning thesis of the 1993 ACM Doctoral Dissertation Competition. The author improved the presentation and included the progress achieved since the thesis was approved by the University of California at Berkeley...
Is Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems suitable for beginners?
Whether Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems is suitable for beginners depends on your background in Springer. Review the product description and specifications above for details on the target audience and difficulty level.
What edition is Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems?
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems is from the Springer edition/year. Check the specifications section for full edition details.
How do I order Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems on GlowMirror?
To order Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems on GlowMirror, click the "Add to Cart" button on this page, proceed to checkout, and choose your preferred payment method — online payment or Cash on Delivery. Delivery takes 2–7 business days across India.
Is Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems a new or used book?
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems listed on GlowMirror is a brand new book in good condition.
Can I get Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems delivered across India?
Yes, GlowMirror delivers Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems across India. Use the pincode checker on this page to verify delivery availability to your location.
