Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems

Name: Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
Brand: Springer
SKU: 9783540606154
Price: 5425.00 INR
Availability: InStock

by Madhu Sudan

Springer · 1995

₹5,425

Free delivery. Nothing extra to pay at checkout.

Same Day ShippingIn 3–5 days

15-Day ReturnEasy returns

Genuine BookPhysical copy only

Available Offers

🏷️Use code GIG9, pay ₹4,937 — save ₹488 (up to ₹500 off per order)
💵Cash on Delivery — pay when the parcel reaches you

About this book

Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems is written by Madhu Sudan. This edition is published by Springer (1995). The book is part of the Lecture notes in computer science series.

Topics covered include Computational complexity, NP-complete problems and Automatic theorem proving.