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

Sudan, Madhu

ISBN 10: 3540606157 / ISBN 13: 9783540606154

Published by Springer, 1995

About this Item

LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS.

Seller Inventory # ERICA70435406061575

Bibliographic Details

• Title: Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (Lecture Notes in Computer Science)
• Publisher: Springer
• Publication Date: 1995
• Language: English
• ISBN 10: 3540606157
• ISBN 13: 9783540606154
• Binding: Paperback
• Condition: Like New
• Book Type: book

About this title

Synopsis

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.

About the Author

Madhu Sudan is currently a Research Staff Member in the Mathematical Sciences Department at IBM's Thomas J. Watson Research Center, Yorktown Heights, New York.