Efficient checking of polynomials and proofs and the hardness of approximation problems
By: Madhu Sudan.
Series: Lecture notes in computer science ;; 1001
Publisher: Springer₋Verlag
Published: 1995
Place of publication: Berlin; New York
Language: eng
Number of pages: 87
Subjects: NP-complete problems; Computational complexity; Automatic theorem proving
Description: 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.
Notes: Includes bibliographical references (p. [73]-78) and index.
Based on the author's Ph. D. thesis, University of California, Berkeley, 1993.