Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems - Lecture Notes in Computer Science - Madhu Sudan - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783540606154 - December 13, 1995
In case cover and title do not match, the title is correct

Madhu Sudan
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems - Lecture Notes in Computer Science

Price
HK$ 428
excl. VAT

Ordered from remote warehouse

Expected to be ready for shipping Jul 14 - 20

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Not rated yet

Building on results in theoretical computer science, this work offers theoretical insights and advances in applicable techniques in such areas as computational complexity, efficient (randomized) checking of proofs, programs and polynomials, approximation algoritms, and NP-complete optimization.

94 pages, biography

Media Books     Paperback Book   (Book with soft cover and glued back)
Released December 13, 1995
ISBN13 9783540606154
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 94
Dimensions 156 × 234 × 5 mm   ·   163 g
Language German  
Editor Sudan, Madhu

Mere med samme udgiver

See all of Madhu Sudan ( e.g. Paperback Book )