A polynomial time algorithm for computing the HNF of a module over the integers of a number field (Q5244519)

From MaRDI portal
Revision as of 10:44, 16 December 2024 by Import241212081232 (talk | contribs) (Add wikidata reference.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6420343
Language Label Description Also known as
English
A polynomial time algorithm for computing the HNF of a module over the integers of a number field
scientific article; zbMATH DE number 6420343

    Statements

    A polynomial time algorithm for computing the HNF of a module over the integers of a number field (English)
    0 references
    0 references
    0 references
    27 March 2015
    0 references
    complexity
    0 references
    Hermite normal form
    0 references
    modules
    0 references
    number theory
    0 references

    Identifiers

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