Home
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems / Edition 1
Barnes and Noble
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems / Edition 1
Current price: $54.99
![Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems / Edition 1](https://prodimage.images-bn.com/pimages/9783540606154_p0_v2_s600x595.jpg)
![Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems / Edition 1](https://prodimage.images-bn.com/pimages/9783540606154_p0_v2_s600x595.jpg)
Barnes and Noble
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems / Edition 1
Current price: $54.99
Size: OS
Loading Inventory...
*Product information may vary - to confirm product availability, pricing, shipping and return information please contact Barnes and Noble
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.