---

＜電子ブック＞
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems / edited by Madhu Sudan
(Lecture Notes in Computer Science. ISSN:16113349 ; 1001)

版	1st ed. 1995.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1995
本文言語	英語
大きさ	XIV, 94 p : online resource
著者標目	Sudan, Madhu editor SpringerLink (Online service)
件　名	LCSH:Algorithms LCSH:Computer science LCSH:Software engineering LCSH:Machine theory LCSH:Coding theory LCSH:Information theory LCSH:Numerical analysis FREE:Algorithms FREE:Computer Science Logic and Foundations of Programming FREE:Software Engineering FREE:Formal Languages and Automata Theory FREE:Coding and Information Theory FREE:Numerical Analysis
一般注記	On the resilience of polynomials -- Low-degree tests -- Transparent proofs and the class PCP -- Hardness of approximations -- Conclusions 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 HTTP:URL=https://doi.org/10.1007/3-540-60615-7

 類似資料