Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems - Lecture Notes in Computer Science - Madhu Sudan - Knjige - Springer-Verlag Berlin and Heidelberg Gm - 9783540606154 - 13. decembra 1995
Če se naslovnica in naslov ne ujemata, je naslov pravilen

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

Cena
€ 50,49

Naročeno iz oddaljenega skladišča

Predvidena dobava 6. - 16. nov
Božična darila lahko vrnete do 31. januarja
Prejemajte obvestila o novih izdajah izvajalca Madhu Sudan
Dodaj na svoj seznam želja iMusic

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

Medij Knjige     Paperback Book   (Knjiga z mehkimi platnicami in lepljenim hrbtom)
Izdano 13. decembra 1995
ISBN13 9783540606154
Založniki Springer-Verlag Berlin and Heidelberg Gm
Strani 94
Dimenzije 156 × 234 × 5 mm   ·   163 g
Jezik Nemščina  
Urednik Sudan, Madhu

Več od istega **izdajatelja**