Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems (Lecture Notes in Computer Science, 1001, Band 1001)

Allgemein

Marke
Springer Berlin Heidelberg
ISBN
Springer Berlin Heidelberg 3540606157
MPN
Springer Berlin Heidelberg 6943835

Eigenschaften

Menü