Tell your friends about this item:
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems - Lecture Notes in Computer Science Madhu Sudan
Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems - Lecture Notes in Computer Science
Madhu Sudan
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 |