A fast parallel algorithm to compute the rank of a matrix over an arbitrary field (Q1097640)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
scientific article

    Statements

    A fast parallel algorithm to compute the rank of a matrix over an arbitrary field (English)
    0 references
    0 references
    1987
    0 references
    It is shown that the rank of a matrix can be computed in \(O(\log^ 2n)\) time using \(O(n^{4.5})\) processors, referring to a result of Borodin et al.
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel complexity
    0 references
    rank of a matrix
    0 references
    0 references
    0 references