Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix

Kannan, R., & Bachem, A. (1979). Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix. SIAM Journal on Computing, 499-507.

Type

Journal article

Intellectual base

Primary research

Year

1979

DOI

10.1137/0208040

Link

https://doi.org/10.1137/0208040

Cited by

1 citation across 1 artifact.

Domain-specific

• Hermite normal form
  • Hermite normal form is a canonical echelon-like matrix form over the integers used to represent lattices and solve integer-coordinate linear systems.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:3f7075f2c3a4 · see in the full table