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

AKTUELLE PARTNERANGEBOTE

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

Brand : Springer, Binding : Taschenbuch, Edition : 1995, Label : Springer, Publisher : Springer, NumberOfItems : 1, medium : Taschenbuch, numberOfPages : 108, publicationDate : 2008-06-13, authors : Madhu Sudan, ISBN : 3540606157

2 Angebote · ab 53,49 € gemeldete Gesamtkosten