Relations between exact and approximate bilinear algorithms. Applications (Q1152203): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3890107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Solutions for the Bilinear Form Computational Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5829041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5553606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Fast Algorithms for Matrix Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of matrix algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank

Revision as of 11:13, 13 June 2024

scientific article
Language Label Description Also known as
English
Relations between exact and approximate bilinear algorithms. Applications
scientific article

    Statements

    Relations between exact and approximate bilinear algorithms. Applications (English)
    0 references
    0 references
    1980
    0 references
    APA-algorithms
    0 references
    EC-algorithms
    0 references
    matrix multiplication
    0 references
    computational complexity
    0 references
    calculation of bilinear forms
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references