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

Iliopoulos, C. S. (1989). 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.

Type

Unclassified

Intellectual base

Unclassified

Year

1989

DOI

10.1137/0218045

Link

https://doi.org/10.1137/0218045

Cited by

1 citation across 1 artifact.

Domain-specific

• Computational complexity of matrix multiplication
  • … approximate model, arithmetic and bit-cost convention, exponent definition, algorithm and recursion, upper or lower bound, communication and memory, stability and practical regime are explicit. to An applied instance preserves the same invariant under changed scale, notation, jurisdiction, dataset, or implementation..

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:77482e9ae0e3 · see in the full table