TY - BOOK ID - 22785646 TI - Efficient checking of polynomials and proofs and the hardness of approximation problems PY - 1996 VL - 1001 SN - 3540606157 0387606157 354048485X PB - Berlin ; Heidelberg ; New York Springer Verlag DB - UniCat KW - Automatic theorem proving KW - Berekeningen [Ingewikkeldheid van ] KW - Calcul [Complexité de ] KW - Complexité de calcul KW - Computational complexity KW - Ingewikkeldheid van berekeningen KW - NP-complete problems KW - Theorema's--Automatische bewijsvoering KW - Théorèmes--Démonstration automatique KW - Computer software. KW - Logic design. KW - Software engineering. KW - Computer science. KW - Coding theory. KW - Numerical analysis. KW - Algorithm Analysis and Problem Complexity. KW - Logics and Meanings of Programs. KW - Software Engineering. KW - Mathematical Logic and Formal Languages. KW - Coding and Information Theory. KW - Numerical Analysis. KW - Software, Computer KW - Computer systems KW - Mathematical analysis KW - Data compression (Telecommunication) KW - Digital electronics KW - Information theory KW - Machine theory KW - Signal theory (Telecommunication) KW - Computer programming KW - Informatics KW - Science KW - Computer software engineering KW - Engineering KW - Design, Logic KW - Design of logic systems KW - Electronic circuit design KW - Logic circuits KW - Switching theory UR - https://www.unicat.be/uniCat?func=search&query=sysid:22785646 AB - 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. ER -