New combinations of methods for the acceleration of matrix multiplication (Q1154805): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0898-1221(81)90009-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2160563446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / 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: New Fast Algorithms for Matrix Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial and Total Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebras Having Linear Multiplicative Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5676984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Continued Fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of multiplications necessary to compute certain functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4047029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Obtaining Upper Bounds on the Complexity of 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: Q5581154 / rank
 
Normal rank

Latest revision as of 12:49, 13 June 2024

scientific article
Language Label Description Also known as
English
New combinations of methods for the acceleration of matrix multiplication
scientific article

    Statements

    Identifiers