The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\) (Q389730): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.laa.2013.01.031 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W1737655677 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1211.6320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Lower Bounds for the Rank of Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for the border rank of 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: Rank and optimal computation of generic tensors / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2013.01.031 / rank
 
Normal rank

Latest revision as of 16:07, 9 December 2024

scientific article
Language Label Description Also known as
English
The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\)
scientific article

    Statements

    The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\) (English)
    0 references
    0 references
    0 references
    21 January 2014
    0 references
    tensors
    0 references
    matrix multiplication
    0 references
    complexity theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references