- Afhalen na 1 uur in een winkel met voorraad
- Gratis thuislevering in België vanaf € 30
- Ruim aanbod met 7 miljoen producten
- Afhalen na 1 uur in een winkel met voorraad
- Gratis thuislevering in België vanaf € 30
- Ruim aanbod met 7 miljoen producten
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
Madhu Sudan
€ 52,95
+ 105 punten
Omschrijving
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.
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
Betrokkenen
- Auteur(s):
- Uitgeverij:
Inhoud
- Aantal bladzijden:
- 94
- Taal:
- Engels
- Reeks:
- Reeksnummer:
- nr. 1001
Eigenschappen
- Productcode (EAN):
- 9783540606154
- Verschijningsdatum:
- 13/12/1995
- Uitvoering:
- Paperback
- Formaat:
- Trade paperback (VS)
- Afmetingen:
- 156 mm x 234 mm
- Gewicht:
- 163 g
Alleen bij Standaard Boekhandel
+ 105 punten op je klantenkaart van Standaard Boekhandel
E-BOOK ACTIE
Beoordelingen
We publiceren alleen reviews die voldoen aan de voorwaarden voor reviews. Bekijk onze voorwaarden voor reviews.