Table of contents

  1. Front Matter
  2. Pages 1-14
  3. Pages 23-46
  4. Pages 69-71
  5. Back Matter

About this book

Introduction

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.

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

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-60615-7
  • Copyright Information Springer-Verlag 1995
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-60615-4
  • Online ISBN 978-3-540-48485-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book