Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (Lecture Notes in Computer Science, nr. 1001)

Editat de Madhu Sudan
Notă GoodReads:
en Limba Engleză Carte Paperback – 12 Dec 1995
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 25958 lei

Preț vechi: 32448 lei

Puncte Express: 389

Preț estimativ în valută:
5320 6272$ 4731£

Carte tipărită la comandă

Livrare economică 27 decembrie 17 - 09 ianuarie 18
Livrare express 29 noiembrie-05 decembrie pentru 17780 lei

Preluare comenzi: 021 569.72.76


ISBN-13: 9783540606154
ISBN-10: 3540606157
Pagini: 108
Dimensiuni: 155 x 235 x 6 mm
Greutate: 0.36 kg
Ediția: 1995
Editura: Springer
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării: Berlin, Heidelberg, Germany

Public țintă



On the resilience of polynomials.- Low-degree tests.- Transparent proofs and the class PCP.- Hardness of approximations.- Conclusions.