Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1137/1034049 | SIAM Review |
Keywords | Field | DocType |
ALGORITHMS,NUMERICAL LINEAR ALGEBRA,MATRIX COMPUTATIONS,ALGEBRAIC COMPUTING,POLYNOMIALS,COMPUTATIONAL COMPLEXITY | Matrix calculus,Algebraic number,Algorithmics,Polynomial,Polynomial matrix,Algebra,Matrix (mathematics),Mathematical analysis,Algorithm,Numerical linear algebra,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
34 | 2 | 0036-1445 |
Citations | PageRank | References |
29 | 3.35 | 26 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Victor Pan | 1 | 62 | 9.52 |