Efficient checking of polynomials and proofs and the hardness of approximation problems

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...

Description complète

Enregistré dans:
Détails bibliographiques
Auteur principal: Sudan, Madhu
Format: Livre numérique
Langue:Anglais
Publié: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Collection:Lecture notes in computer science 1001
Sujets:
Accès en ligne:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Note: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Efficient checking of polynomials and proofs and the hardness of approximation problems, Madhu Sudan, New York, Springer, 1996, 1 vol. (xiv, 87 p.), Lecture notes in computer science, 3-540-60615-7
• Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Texte imprimé, 9783662180709
Description
Résumé: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.
Description:Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
ISBN:9783540484851
ISSN:1611-3349
Accès:Accès en ligne pour les établissements français bénéficiaires des licences nationales
Accès soumis à abonnement pour tout autre établissement
Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017