Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
- 1 August 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 18 (4) , 658-669
- https://doi.org/10.1137/0218045
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Algorithms for the Solution of Systems of Linear Diophantine EquationsSIAM Journal on Computing, 1982
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer MatrixSIAM Journal on Computing, 1979
- The influence of computers on algebraProceedings of Symposia in Applied Mathematics, 1974
- Schnelle Berechnung von KettenbruchentwicklungenActa Informatica, 1971
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- XV. On systems of linear indeterminate equations and congruencesPhilosophical Transactions of the Royal Society of London, 1861