Efficient checking of polynomials and proofs and the hardness of approximation problems /
This work is a fascinating piece of research in computer science: it is built on and combines deep theoretical results from various areas and, at the same time, takes into account applications to hard problems in several fields. The author provides important new foundational insights and essentially...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | English |
| Published: |
Berlin ; New York :
Springer?b-?sVerlag,
c1995.
|
| Series: | Lecture notes in computer science ;
1001. |
| Subjects: |
| Summary: | This work is a fascinating piece of research in computer science: it is built on and combines deep theoretical results from various areas and, at the same time, takes into account applications to hard problems in several fields. The author provides important new foundational insights and essentially 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. |
|---|---|
| Physical Description: | xiv, 87 p. ; 24 cm. |
| Bibliography: | Includes bibliographical references (p. [73]-78) and index. |
| ISBN: | 3540606157 |