Buy Now, In-Store Pick Up Only

  • Front cover_Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
Free Preview 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

Edited by Madhu Sudan
Dec 13, 1995
$71.50
Online pricing. Prices and offers may vary in store.
.
.    Learn More
This product requires a minimum order of  1
Final Sale. No returns or exchanges.
This item will be shipped by appointment through our delivery partner.

Ship to me

Checking availability…

Buy now & pick up in store

Checking availability…

Find it in store

Checking availability…

Earn 358 points and enjoy extra savings with plum+. 

Overview

Appropriate for
Language
No. of Pages
94
Lecture Notes In Computer Science
Publisher: Springer
Shipping dimensions: 9" H x 6" W x 1" L
ISBN: 9783540606154
Life stage: null

You May Also Like

Ratings & Reviews

  • bvseo_sdk, dw_cartridge, 18.2.0, p_sdk_3.2.0
  • CLOUD, getReviews, 5ms
  • reviews, product
  • bvseo-msg: Unsuccessful GET. status = 'ERROR', msg = 'Not Found.'; Unsuccessful GET. status = 'ERROR', msg = 'Not Found.';

Editorial reviews

madhu sudan

Author

Others Also Bought