'Columbia University Libraries/Information Services'
Doi
Abstract
We review 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
