Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems

Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems

Sudan, Madhu (Ed.)

1995, XIV, 94 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 

ISBN 978-3-540-48485-1

digitally watermarked, no DRM

The eBook version of this title will be available soon


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$99.00

(net) price for USA

ISBN 978-3-540-60615-4

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • About this book

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.

Content Level » Research

Keywords » Beweispr├╝fung - Optimierung - Probabilistische Algorithmen - algorithm - algorithms - approximation - class - coding - coding theory - complexity - computer science - differential equation - error-correcting code - optimization - theoretical computer science

Related subjects » Computational Science & Engineering - Software Engineering - Theoretical Computer Science

Table of contents 

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

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algorithm Analysis and Problem Complexity.