A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications (Q4085178): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Multiplications Required for Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le calcul des produits de matrices. (Calculation of the product of matrices.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimizing the Number of Multiplications Necessary for Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Inner Product / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiplication of 2 \(\times\) 2 matrices / rank
 
Normal rank

Latest revision as of 17:16, 12 June 2024

scientific article; zbMATH DE number 3504384
Language Label Description Also known as
English
A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
scientific article; zbMATH DE number 3504384

    Statements

    Identifiers