Efficient Checking of Polynomials and Proofs and the Hardness of approximation Problems
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch
74.89 €
37 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Efficient Checking of Polynomials and Proofs and the Hardness of approximation Problems “
Klappentext zu „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 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.
Inhaltsverzeichnis zu „Efficient Checking of Polynomials and Proofs and the Hardness of approximation Problems “
On the resilience of polynomials.- Low-degree tests.- Transparent proofs and the class PCP.- Hardness of approximations.- Conclusions.
Bibliographische Angaben
- Autor: Madhu Sudan
- 1995, 1995, 94 Seiten, Maße: 15,5 x 23,5 cm, Kartoniert (TB), Englisch
- Herausgegeben: Madhu Sudan
- Verlag: Springer
- ISBN-10: 3540606157
- ISBN-13: 9783540606154
- Erscheinungsdatum: 13.12.1995
Sprache:
Englisch
Kommentar zu "Efficient Checking of Polynomials and Proofs and the Hardness of approximation Problems"
0 Gebrauchte Artikel zu „Efficient Checking of Polynomials and Proofs and the Hardness of approximation Problems“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Efficient Checking of Polynomials and Proofs and the Hardness of approximation Problems".
Kommentar verfassen