Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation (Q898244): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient matrix preconditioners for black box linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black box Frobenius decompositions over small fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving sparse rational linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the matrix berlekamp-massey algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalized Jordan Canonical Form / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the similarity transformation between a matrix and its transpose / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block solution of sparse linear systems over GF (q) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving sparse linear equations over finite fields / rank
 
Normal rank

Latest revision as of 03:56, 11 July 2024

scientific article
Language Label Description Also known as
English
Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation
scientific article

    Statements

    Identifiers