Contact
Cum să cumpăr
Livrare
Consilier de cumpărături
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
engleză
132 b
Până la 30 de zile pentru returnare
Clienții au cumpărat de asemenea
/
Copertă tare
2 090.73
lei
/
Copertă tare
174.86
lei
/
Carte broșată
131.71
lei
/
Carte broșată
153.91
lei
/
Carte broșată
103.13
lei
/
Audio CD
83.97
lei
This book is based on the author's PhD thesis which was selected as the winning thesis of the 1993 ACMDoctoral 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.
Informații despre carte
engleză
Categorii
