Get 40% off our selection of bestselling print books in Engineering through October 31st!

Lecture Notes in Computer Science Lect.Notes Computer. ACM Distinguished Theses

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

Editors: Sudan, Madhu (Ed.)

Buy this book

eBook 59,49 €
price for Spain (gross)
  • ISBN 978-3-540-48485-1
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover 72,79 €
price for Spain (gross)
  • ISBN 978-3-540-60615-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
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.

Table of contents (6 chapters)

  • Introduction

    Pages 1-14

  • On the resilience of polynomials

    Pages 15-22

  • Low-degree tests

    Pages 23-46

  • Transparent proofs and the class PCP

    Pages 47-59

  • Hardness of approximations

    Pages 61-68

Buy this book

eBook 59,49 €
price for Spain (gross)
  • ISBN 978-3-540-48485-1
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover 72,79 €
price for Spain (gross)
  • ISBN 978-3-540-60615-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
Editors
  • Madhu Sudan
Series Title
Lecture Notes in Computer Science
Series Volume
1001
Copyright
1995
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-48485-1
DOI
10.1007/3-540-60615-7
Softcover ISBN
978-3-540-60615-4
Series ISSN
0302-9743
Edition Number
1
Number of Pages
XIV, 94
Topics