On the complexity of the multiplication of matrices of small formats (Q1394936): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algorithmic complexity of associative algebras / 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: Lower bounds for the multiplicative complexity of matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the bilinear complexity of associative algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal evaluation of a set of bilinear forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix 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: Lectures on the complexity of bilinear problems / 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: Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial and Total 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: Relative bilinear complexity and matrix multiplication. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Winograd's Algorithm for Inner Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiplication of 2 \(\times\) 2 matrices / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:00, 5 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of the multiplication of matrices of small formats
scientific article

    Statements

    On the complexity of the multiplication of matrices of small formats (English)
    0 references
    0 references
    25 June 2003
    0 references
    0 references
    matrix multiplication
    0 references