🚚 Free shipping on orders above ₹499  |  Easy 7-day returns  |  100% authentic products
GlowMirror
HomeSpringerEfficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (English, Madhu Sudan)
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (English, Madhu Sudan)
Springer

Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (English, Madhu Sudan)

5,425

Inclusive of all taxes. Free shipping on orders above ₹499.

Quantity:
1
Free DeliveryAbove ₹499
7-Day ReturnEasy returns
100% AuthenticVerified product

Product Description

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

Specifications

PublisherSpringer
LanguageEnglish
ISBN-139783540606154
ISBN-103540606157
AuthorMadhu Sudan