Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems: 1001 (Lecture Notes in Computer Science, 1001) - Softcover
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.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Efficient Checking of Polynomials and Proofs and the...
Seller Image
Efficient checking of polynomials and proofs and the hardness of approximation problems. Lecture notes in computer science ; 1001
Seller: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germany
Seller rating 5 out of 5 stars
Broschiert. Condition: Gut. XIV, 87 Seiten; Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber. Es befindet sich lediglich ein Bibliotheksstempel im Buch; ordnungsgemäß entwidmet. Sprache: Englisch Gewicht in Gramm: 160. Seller Inventory # 1452657
Stock Image
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (Lecture Notes in Computer Science, 1001)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540606154_new
Buy New
£ 49.34
£ 11.98 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783540606154
Buy New
£ 47.27
£ 15.49 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 10 available
Seller Image
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 1995, 1995
ISBN 10: 3540606157
ISBN 13: 9783540606154
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 108 pp. Englisch. Seller Inventory # 9783540606154
Seller Image
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
Published by
Springer Berlin Heidelberg, 1995
ISBN 10: 3540606157
ISBN 13: 9783540606154
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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. Seller Inventory # 4895296
Buy New
£ 42.99
£ 42.27 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
Published by
Springer, Springer Dez 1995, 1995
ISBN 10: 3540606157
ISBN 13: 9783540606154
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 108 pp. Englisch. Seller Inventory # 9783540606154
Seller Image
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783540606154
Seller Image
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems | Madhu Sudan | Taschenbuch | xiv | Englisch | 1995 | Springer | EAN 9783540606154 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 102573273
Stock Image
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (Lecture Notes in Computer Science)
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Seller Inventory # ERICA70435406061575