Recursive cellular methods of matrix multiplication (Q6115822): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4040698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast cellular method of matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed cellular method of matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: New cellular methods for matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified cellular method for matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ultrafast cellular method for matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:08, 1 August 2024

scientific article; zbMATH DE number 7712004
Language Label Description Also known as
English
Recursive cellular methods of matrix multiplication
scientific article; zbMATH DE number 7712004

    Statements

    Recursive cellular methods of matrix multiplication (English)
    0 references
    0 references
    13 July 2023
    0 references
    linear algebra
    0 references
    family of cellular matrix multiplication methods
    0 references
    cellular analogs of matrix multiplication algorithms
    0 references

    Identifiers