On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication (Q1131838): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(78)90045-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983419392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5580321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of quaternion multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiplication of 2 \(\times\) 2 matrices / rank
 
Normal rank

Latest revision as of 02:28, 13 June 2024

scientific article
Language Label Description Also known as
English
On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
scientific article

    Statements

    On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication (English)
    0 references
    1978
    0 references
    varieties of optimal algorithms for the computation of bilinear mappings
    0 references
    matrix multiplication
    0 references
    Strassen's algorithm
    0 references
    0 references

    Identifiers