Fast hybrid matrix multiplication algorithms (Q2452754): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3830511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Inner Product / 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
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: Partial and Total Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Asymptotic Complexity of Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for matrix multiplication and its efficient realization on systolic arrays / 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: An integrated approach to the design of processor arrays with systolic organization of computations / rank
 
Normal rank

Latest revision as of 13:44, 8 July 2024

scientific article
Language Label Description Also known as
English
Fast hybrid matrix multiplication algorithms
scientific article

    Statements

    Identifiers