Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation (Q6081940): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Add wikidata reference.
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/3597066.3597099 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4383221959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between exact and approximate bilinear algorithms. Applications / 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: On the additive complexity of 2 \(\times 2\) matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the arithmetic complexity of Strassen-like matrix multiplications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Asymptotic Complexity of Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / 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: Matrix sparsification and the sparse null space problem / 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: Strassen’s Algorithm Reloaded on GPUs / 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: Probabilistic Tensors and Opportunistic Boolean Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Multiplication, a Little Faster / rank
 
Normal rank
Property / cites work
 
Property / cites work: On practical algorithms for accelerated 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: New Fast Algorithms for Matrix Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication / 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: Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling Game and Alternative Basis for High Performance 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: The bilinear complexity and practical algorithms for 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 / Wikidata QID
 
Property / Wikidata QID: Q131124615 / rank
 
Normal rank

Latest revision as of 10:13, 16 December 2024

scientific article; zbMATH DE number 7760773
Language Label Description Also known as
English
Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
scientific article; zbMATH DE number 7760773

    Statements

    Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation (English)
    0 references
    0 references
    0 references
    3 November 2023
    0 references
    bilinear algorithms
    0 references
    fast basis transformation
    0 references
    fast recursive transformation
    0 references
    matrix multiplication
    0 references
    trilinear aggregation
    0 references

    Identifiers