Nearly Optimal Algorithms for Canonical Matrix Forms
- 1 October 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (5) , 948-969
- https://doi.org/10.1137/s0097539793252687
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- On fast multiplication of polynomials over arbitrary algebrasActa Informatica, 1991
- Parallel algorithms for matrix normal formsLinear Algebra and its Applications, 1990
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Fast Parallel Computation of Hermite and Smith Forms of Polynomial MatricesSIAM Journal on Algebraic Discrete Methods, 1987
- Parallel arithmetic computations: A surveyPublished by Springer Nature ,1986
- Solving systems of linear equations over polynomialsTheoretical Computer Science, 1985
- The complexity of partial derivativesTheoretical Computer Science, 1983
- Fast Algorithms for Manipulating Formal Power SeriesJournal of the ACM, 1978
- Triangular factorization and inversion by fast matrix multiplicationMathematics of Computation, 1974
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970