Efficient checking of polynomials and proofs and the hardness of approximation problems
by Madhu Sudan
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.
Check nearby libraries
Buy this book
Previews available in: English
| Edition | Availability |
|---|---|
1
Efficient checking of polynomials and proofs and the hardness of approximation problems
1995, Springer₋Verlag
in English
3540606157 9783540606154
|
aaaa
|
Book Details
Edition Notes
Includes bibliographical references (p. [73]-78) and index.
Based on the author's Ph. D. thesis, University of California, Berkeley, 1993.
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
Lists
History
- Created April 1, 2008
- 15 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| July 18, 2024 | Edited by MARC Bot | import existing book |
| January 14, 2023 | Edited by ImportBot | import existing book |
| October 23, 2021 | Edited by ImportBot | import existing book |
| October 5, 2021 | Edited by ImportBot | import existing book |
| April 1, 2008 | Created by an anonymous user | Imported from Scriblio MARC record |