On the arithmetic complexity of Strassen-like matrix multiplications (Q346560): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114154472, #quickstatements; #temporary_batch_1712260040974
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jsc.2016.07.004 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Algorithm 898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extra High Speed Matrix Multiplication on the Cray-2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Cryptanalysis / 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: A Strassen-like matrix multiplication suited for squaring and higher power computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the implementation of Strassen's fast multiplication algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GEMMW: A portable level 3 BLAS Winograd variant of Strassen's matrix- matrix multiply algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FFPACK / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Cryptanalysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The aggregation and cancellation techniques as a practical tool for faster 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: How to multiply matrices faster / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Additive Complexity of 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: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiplication of 2 \(\times\) 2 matrices / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JSC.2016.07.004 / rank
 
Normal rank

Latest revision as of 14:56, 9 December 2024

scientific article
Language Label Description Also known as
English
On the arithmetic complexity of Strassen-like matrix multiplications
scientific article

    Statements

    On the arithmetic complexity of Strassen-like matrix multiplications (English)
    0 references
    0 references
    0 references
    29 November 2016
    0 references
    fast matrix multiplication
    0 references
    Strassen-like matrix multiplication
    0 references
    computational complexity
    0 references
    cryptographic computations
    0 references
    computer algebra
    0 references
    0 references
    0 references
    0 references

    Identifiers