Algebraic complexity theory, the study of the minimum number of operations sufficient to perform algebraic computations, is surveyed with emphasis on the general theory of bilinear forms and two of its applications: polynomial multiplication and matrix multiplication. Though by no means exhausting algebraic complexity theory, these topics illustrate well its development and its methods, and provide examples of its most striking successes.
© 1981 International Business Machines Corporation
Pippenger, N. "Algebraic Complexity Theory", IBM J. Res. and Dev., 25 (1981), 825-832.