Dynamic matrix rank with partial lookahead (Q2254496): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Dynamic matrix rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Normal Forms and Dynamic Characteristic Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum rank matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast dynamic transitive closure with lookahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank

Latest revision as of 16:32, 9 July 2024

scientific article
Language Label Description Also known as
English
Dynamic matrix rank with partial lookahead
scientific article

    Statements

    Dynamic matrix rank with partial lookahead (English)
    0 references
    5 February 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    dynamic algorithm
    0 references
    matrix rank
    0 references
    lookahead
    0 references
    bulk update using matrix multiplication
    0 references
    0 references