Efficient checking of polynomials and proofs and the hardness of approximation problems
著者
書誌事項
Efficient checking of polynomials and proofs and the hardness of approximation problems
（Lecture notes in computer science, 1001）
Springer-Verlag, c1995
大学図書館所蔵 件 / 全54件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Bibliography: p. [73]-78
Includes index
内容説明・目次
内容説明
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.
目次
On the resilience of polynomials.- Low-degree tests.- Transparent proofs and the class PCP.- Hardness of approximations.- Conclusions.
「Nielsen BookData」 より