• usp_easy_retunsFree & Easy Returns
  • usp_best_dealsBest Deals
placeholder
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
magnifyZoom

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

262.00
nudge icon
Free Delivery
nudge icon
Free Delivery
noon-marketplace
Get it by 11 July
Order in 13h24m

Coupons

decorative
Extra 15% off

Payment discount

placeholder
/visa/
Product Overview

Specifications

PublisherSpringer
ISBN 103540606157
LanguageEnglish
Publication Date13 December 1995
ISBN 139783540606154
AuthorMadhu Sudan
Book DescriptionThis 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.
Number of Pages108 pages
Cart Total  262.00
placeholder
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems
262.00
262
0

We're Always Here To Help

Reach out to us through any of these support channels

Shop On The Go

App StoreGoogle PlayHuawei App Gallery

Connect With Us

mastercardvisatabbytamaraamexcod