Springer
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
Product Code:
9783540606154
ISBN13:
9783540606154
Condition:
New
$61.47
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
$61.47
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.
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.
| Author: Madhu Sudan |
| Publisher: Springer |
| Publication Date: Dec 13, 1995 |
| Number of Pages: 94 pages |
| Binding: Paperback or Softback |
| ISBN-10: 3540606157 |
| ISBN-13: 9783540606154 |
Related Products
