On the complexity of computing determinants (Q1766817)

From MaRDI portal
Revision as of 23:43, 27 June 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56459440, #quickstatements; #temporary_batch_1719524507666)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of computing determinants
scientific article

    Statements

    On the complexity of computing determinants (English)
    0 references
    0 references
    0 references
    1 March 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Integer matrix
    0 references
    matrix determinant
    0 references
    characteristic polynomial
    0 references
    Smith normal form
    0 references
    bit complexity
    0 references
    division-free complexity
    0 references
    randomized algorithm
    0 references
    multivariable control theory
    0 references
    realization
    0 references
    matrix sequence
    0 references
    block Wiedemann algorithm
    0 references
    block Lanczos algorithm
    0 references
    0 references
    0 references