1990 Reports
Complexity of Computations with Matrices and Polynomials
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.
Files
-
cucs-031-90.pdf
application/pdf
161 KB
Download File
More About This Work
- Academic Units
- Computer Science
- Publisher
- Department of Computer Science, Columbia University
- Series
- Columbia University Computer Science Technical Reports, CUCS-031-90
- Published Here
- March 8, 2012