Bibliography
- ABM99
-
John Abbott, Manuel Bronstein, and Thom Mulders.
Fast Deterministic Computation of Determinants of Dense Matrices.
In Sam Dooley, editor, Proceedings ISSAC'99, pages 197--204, New York, 1999. ACM Press.
- CC82
-
T.W.J. Chou and G.E. Collins.
Algorithms for the solution of systems of linear Diophantine equations.
SIAM J. Computing, 11(4):687--708, 1982.
- CLG97
-
Frank Celler and Charles R. Leedham-Green.
Calculating the Order of an Invertible Matrix.
In Larry Finkelstein and William M. Kantor, editors, Groups and Computation II, volume 28 of DIMACS Series in Discrete Mathematics and
Theoretical Computer Science, pages 55--60. AMS, 1997.
- HHR93
-
George Havas, Derek F. Holt, and Sarah Rees.
Recognizing badly presented Z-modules.
Linear Algebra and its Applications, 192:137--164, 1993.
- KB79
-
R. Kannan and A. Bachem.
Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix.
SIAM J. Computing, 9:499--507, 1979.
- Lüb02
-
F. Lübeck.
On the computation of elementary divisors of integer matrices.
J. Symbolic Comp., 33:57--65, 2002.
- Ste97
-
Allan Steel.
A New Algorithm for the Computation of Canonical Forms of Matrices over Fields.
J. Symbolic Comp., 24(3):409--432, 1997.
V2.28, 13 July 2023