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

@article{Iliopoulos1989WorstCaseCB,
  title={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},
  author={Costas S. Iliopoulos},
  journal={SIAM J. Comput.},
  year={1989},
  volume={18},
  pages={658-669}
}

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…