Madhu Sudan
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
Paperback Engels 1995 1995e druk 9783540606154
Verwachte levertijd ongeveer 9 werkdagen
Samenvatting
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.
Specificaties
ISBN13:9783540606154
Taal:Engels
Bindwijze:paperback
Aantal pagina's:94
Uitgever:Springer Berlin Heidelberg
Druk:1995
Hoofdrubriek:Programmeren, Computer en informatica
Lezersrecensies
Wees de eerste die een lezersrecensie schrijft!
Inhoudsopgave
On the resilience of polynomials.- Low-degree tests.- Transparent proofs and the class PCP.- Hardness of approximations.- Conclusions.
Rubrieken
- advisering
- algemeen management
- coaching en trainen
- communicatie en media
- economie
- financieel management
- inkoop en logistiek
- internet en social media
- it-management / ict
- juridisch
- leiderschap
- marketing
- mens en maatschappij
- non-profit
- ondernemen
- organisatiekunde
- personal finance
- personeelsmanagement
- persoonlijke effectiviteit
- projectmanagement
- psychologie
- reclame en verkoop
- strategisch management
- verandermanagement
- werk en loopbaan