Asymptotically Fast Triangularization of Matrices over Rings
- 1 December 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 20 (6) , 1068-1083
- https://doi.org/10.1137/0220067
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Hermite Normal Form Computation Using Modulo Determinant ArithmeticMathematics of Operations Research, 1987
- Complexity questions in number theoryJournal of Mathematical Sciences, 1985
- Algorithms for the Solution of Systems of Linear Diophantine EquationsSIAM Journal on Computing, 1982
- Polynomial Time Algorithms in the Theory of Linear Diophantine EquationsLecture Notes in Computer Science, 1977
- Triangular factorization and inversion by fast matrix multiplicationMathematics of Computation, 1974
- Algorithms for Hermite and Smith normal matrices and linear Diophantine equationsMathematics of Computation, 1971
- Algorithm 288: solution of simultaneous linear Diophantine equations [F4]Communications of the ACM, 1966
- Algorithm 287: matrix triangulation with integer arithmetic [F1]Communications of the ACM, 1966
- Exact solutions of linear equations with rational coefficients by congruence techniquesMathematics of Computation, 1966