Efficient checking of polynomials and proofs and the hardness of approximation problems
By: Sudan, Madhu.
Material type:
BookSeries: 1001. Lecture notes in computer science.Publisher: Berlin: Springer, 1995Description: xiv, 87 p.; ill.: 24 cm.ISBN: 9783540606154.Subject(s): Automatic theorem proving | Computational complexity | NP-complete problems | Coding theory | Polynomial evaluation codeDDC classification: 004 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.
| Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
| Books | 004 SUD (Browse shelf) | Available | 011939 |
Browsing DAIICT Shelves Close shelf browser
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.
There are no comments for this item.