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

Pages

499-507

DOI

10.1137/0208040

DOI registrant

Society for Industrial & Applied Mathematics

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

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

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