Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (Paperback, 1995 ed.)

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.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Lecture Notes in Computer Science, 1001
Release date:	December 1995
First published:	1995
Editors:	Madhu Sudan
Dimensions:	235 x 155 x 5mm (L x W x T)
Format:	Paperback
Pages:	94
Edition:	1995 ed.
ISBN-13:	978-3-540-60615-4
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Vector & tensor analysis
LSN:	3-540-60615-7
Barcode:	9783540606154

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!