Skip to main content alibris logo

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

by

Write The First Customer Review
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems - Sudan, Madhu (Editor)
Filter Results
Shipping
Item Condition
Seller Rating
Other Options
Change Currency

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 advances applicable techniques in such different areas as computational complexity ...

loading
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems 1995, Springer, Berlin, Heidelberg

ISBN-13: 9783540606154

1995 edition

Trade paperback