Contact
Comment faire ses achats
Livraison
Guide d'achat
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
Anglais
161 b
common.delivery_to
Politique de retour sous 30 jours
Ceci pourrait également vous intéresser
/
Livre de poche
271.13
€
/
Livre relié
353.55
€
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.
À propos du livre
Anglais
Catégories
