| 書目名稱 | Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems |
| 編輯 | Madhu Sudan |
| 視頻video | http://file.papertrans.cn/303/302965/302965.mp4 |
| 叢書名稱 | Lecture Notes in Computer Science |
| 圖書封面 |  |
| 描述 | 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. |
| 出版日期 | Book 1995 |
| 關(guān)鍵詞 | Beweisprüfung; Optimierung; Probabilistische Algorithmen; algorithm; algorithms; approximation; class; codi |
| 版次 | 1 |
| doi | https://doi.org/10.1007/3-540-60615-7 |
| isbn_softcover | 978-3-540-60615-4 |
| isbn_ebook | 978-3-540-48485-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag Berlin Heidelberg 1995 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-27 13:30
發(fā)表于 2025-3-21 17:08:56
