On Efficient Sparse Integer Matrix Smith Normal Form Computations

This publication has 17 references indexed in Scilit:

• COMPLEXES OF NOT i-CONNECTED GRAPHS
  Topology, 1999
• Complexes of Directed Graphs
  SIAM Journal on Discrete Mathematics, 1999
• The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
  Mathematics of Computation, 1999
• Regions in the Complex Plane Containing the Eigenvalues of a Matrix
  The American Mathematical Monthly, 1994
• Chessboard Complexes and Matching Complexes
  Journal of the London Mathematical Society, 1994
• 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
  SIAM Journal on Computing, 1989
• Exact solution of linear equations usingP-adic expansions
  Numerische Mathematik, 1982
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
  SIAM Journal on Computing, 1979
• Limits for the characteristic roots of a matrix. II.
  Duke Mathematical Journal, 1947
• Limits for the characteristic roots of a matrix
  Duke Mathematical Journal, 1946