Treffer: Complexity of Computations with Matrices and Polynomials
Title:
Complexity of Computations with Matrices and Polynomials
Authors:
Publisher Information:
Department of Computer Science, Columbia University
Publication Year:
1990
Collection:
Columbia University: Academic Commons
Subject Terms:
Document Type:
Report
report
Language:
English
Relation:
DOI:
10.7916/D89S2049
Availability:
Accession Number:
edsbas.AF0C3BA0
Database:
BASE
Weitere Informationen
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.