Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems [[electronic resource] /] / edited by Madhu Sudan
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Autore: |
Sudan Madhu
|
| Titolo: |
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems [[electronic resource] /] / edited by Madhu Sudan
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Edizione: | 1st ed. 1995. |
| Descrizione fisica: | 1 online resource (XIV, 94 p.) |
| Disciplina: | 005.1/4/015113 |
| Soggetto topico: | Algorithms |
| Computer logic | |
| Software engineering | |
| Mathematical logic | |
| Coding theory | |
| Information theory | |
| Numerical analysis | |
| Algorithm Analysis and Problem Complexity | |
| Logics and Meanings of Programs | |
| Software Engineering | |
| Mathematical Logic and Formal Languages | |
| Coding and Information Theory | |
| Numerical Analysis | |
| Persona (resp. second.): | SudanMadhu |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di contenuto: | On the resilience of polynomials -- Low-degree tests -- Transparent proofs and the class PCP -- Hardness of approximations -- Conclusions. |
| Sommario/riassunto: | 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. |
| Titolo autorizzato: | Efficient checking of polynomials and proofs and the hardness of approximation problems |
| ISBN: | 3-540-48485-X |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996466039503316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |
Serie:
Lecture Notes in Computer Science, . 0302-9743 ; ; 1001