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 (Q3031927)

From MaRDI portal
scientific article
Language Label Description Also known as
English
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
scientific article

    Statements

    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 (English)
    0 references
    1989
    0 references
    time complexity
    0 references
    Abelian group
    0 references
    integer matrix
    0 references
    Smith normal form
    0 references
    Hermite normal form
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references