Pastāsti draugiem par šo preci:
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
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 1995. gada 13. decembris |
| ISBN13 | 9783540606154 |
| Izdevēji | Springer-Verlag Berlin and Heidelberg Gm |
| Lapas | 94 |
| Izmēri | 156 × 234 × 5 mm · 163 g |
| Valoda | Vācu |
| Redaktors | Sudan, Madhu |