Table of contents for Algebraic complexity theory / Peter Burgisser, Michael Clausen, M. Amin Shokrollahi ; with the collaboration of Thomas Lickteig.

Bibliographic record and links to related information available from the Library of Congress catalog

Information from electronic data provided by the publisher. May be incomplete or contain other coding.

From the contents: Efficient algorithms for polynomial manipulation.- The fastest known matrix multiplication algorithms.- Lower bound techniques from algebraic geometry and topology.- Complete treatment of bilinear complexity theory.

Library of Congress subject headings for this publication:
Computational complexity.