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

Madhu Sudan (eds.)3540606157, 9783540606154

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, efficient (randomized) checking of proofs, programs and polynomials, approximation algorithms, NP-complete optimization, and error-detection and error-correction algorithms in coding theory.

---

Table of contents :
Introduction….Pages 1-14
On the resilience of polynomials….Pages 15-22
Low-degree tests….Pages 23-46
Transparent proofs and the class PCP….Pages 47-59
Hardness of approximations….Pages 61-68
Conclusions….Pages 69-71