Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems [1 ed.] 3540606157, 9783540606154
This book is based on the author's PhD thesis which was selected as the winning thesis of the 1993 ACM Doctoral Dis
145 6 736KB
English Pages 94 [98] Year 1995
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
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
![Efficient Checking of Polynomials and Proofs and the Hardness of Appoximation Problems [1 ed.]
3540606157, 9783540606154](https://ebin.pub/img/200x200/efficient-checking-of-polynomials-and-proofs-and-the-hardness-of-appoximation-problems-1nbsped-3540606157-9783540606154.jpg)
![Problems and proofs in real analysis: theory of measure and integration [1 ed.]
9814578509, 9789814578509](https://ebin.pub/img/200x200/problems-and-proofs-in-real-analysis-theory-of-measure-and-integration-1nbsped-9814578509-9789814578509.jpg)
![Mathematical problems and proofs: combinatorics, number theory, and geometry [1 ed.]
9780306459672, 0306459671, 0306469634](https://ebin.pub/img/200x200/mathematical-problems-and-proofs-combinatorics-number-theory-and-geometry-1nbsped-9780306459672-0306459671-0306469634.jpg)
