Häftad, Engelska, 2010
Completeness and Reduction in Algebraic Complexity Theory
Del i serien Algorithms and Computation in Mathematics
1090 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.
Beskrivning
Produktinformation
- Utgivningsdatum: 2010-12-04
- Mått: 155 x 235 x 11 mm
- Vikt: 289 g
- Format: Häftad
- Språk: Engelska
- Serie: Algorithms and Computation in Mathematics
- Antal sidor: 168
- Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- ISBN: 9783642086045
Utforska kategorier
Recensioner i media
"... The subject matter of the book is not easy, since it involves prerequisites from several areas, among them complexity theory, combinatorics, analytic number theory, and representations of symmetric and general linear groups. But the author goes to great lengths to motivate his results, to put them into perspective, and to explain the proofs carefully. In summary, this monograph advances its area of algebraic complexity theory, and is a must for people for working on this subject. And it is a pleasure to read." Joachim von zur Gathen, Mathematical Reviews, Issue 2001g
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.