Efficient checking of polynomials and proofs and the hardness of approximation problems
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...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
1001 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Efficient checking of polynomials and proofs and the hardness of approximation problems, Madhu Sudan, New York, Springer, 1996, 1 vol. (xiv, 87 p.), Lecture notes in computer science, 3-540-60615-7 • Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Texte imprimé, 9783662180709 |
Taula de continguts:
- On the resilience of polynomials
- Low-degree tests
- Transparent proofs and the class PCP
- Hardness of approximations
- Conclusions.