Can I read Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (Lecture Notes in Computer Science, 1001) on EtoBox?

Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (Lecture Notes in Computer Science, 1001) by Madhu Sudan (eds.) is a computer science book available to read on EtoBox.

What is Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (Lecture Notes in Computer Science, 1001) about?

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.<br>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 a

Who reads Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (Lecture Notes in Computer Science, 1001)?

Author

Madhu Sudan (eds.)

Publisher

Springer-Verlag Berlin Heidelberg

Published

1995

Language

EN

ISBN

9783540484851

Category

computer science

Subjects

Mathematics, Engineering, Technology

Updated

2026-03-25