Authors:
- Only monograph with the latest results in the field.
- Includes supplementary material: sn.pub/extras
Part of the book series: Algorithms and Computation in Mathematics (AACIM, volume 7)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (8 chapters)
-
Front Matter
-
Back Matter
About this book
Reviews
".... 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
Authors and Affiliations
-
Fachbereich 17 • Mathematik-Informatik, Universität-Gesamthochschule Paderborn, Paderborn, Germany
Peter Bürgisser
Bibliographic Information
Book Title: Completeness and Reduction in Algebraic Complexity Theory
Authors: Peter Bürgisser
Series Title: Algorithms and Computation in Mathematics
DOI: https://doi.org/10.1007/978-3-662-04179-6
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2000
Hardcover ISBN: 978-3-540-66752-0Published: 21 June 2000
Softcover ISBN: 978-3-642-08604-5Published: 04 December 2010
eBook ISBN: 978-3-662-04179-6Published: 14 March 2013
Series ISSN: 1431-1550
Edition Number: 1
Number of Pages: XII, 168
Topics: Computational Mathematics and Numerical Analysis, Theory of Computation, Algebra