Bounds on complexity of matrix multiplication away from Coppersmith-Winograd tensors (Q2154275): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jpaa.2022.107142 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q114155355 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4280633903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Limitations of the Known Approaches for Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degeneration of tensors and algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Apolarity, border rank, and multigraded Hilbert scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbert schemes of 8 points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials and the exponent of matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barriers for fast matrix multiplication from irreversibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry and Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of tensors and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4989761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial and Total Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plethysm and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative bilinear complexity and matrix multiplication. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JPAA.2022.107142 / rank
 
Normal rank

Latest revision as of 06:52, 17 December 2024

scientific article
Language Label Description Also known as
English
Bounds on complexity of matrix multiplication away from Coppersmith-Winograd tensors
scientific article

    Statements

    Identifiers

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