Complexity of Computations with Matrices and Polynomials
Victor Ya. Pan · SIAM Review · 1992
This paper reviews the complexity of polynomial and matrix computations, as well as their various correlations to each other and some major techniques for the design of algebraic and numerical algorithms.