Matrix Multiplication, a Little Faster

DOI10.1145/3364504zbMath1491.68278OpenAlexW3009870468WikidataQ126346697 ScholiaQ126346697MaRDI QIDQ5133957

Oded Schwartz, Elaye Karstadt

Publication date: 11 November 2020

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3364504

zbMATH Keywords

bilinear algorithmsfast matrix multiplication

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30)

Related Items (5)

Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues ⋮ Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation ⋮ Pebbling Game and Alternative Basis for High Performance Matrix Multiplication ⋮ Strassen's Algorithm for Tensor Contraction ⋮ Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic

This page was built for publication: Matrix Multiplication, a Little Faster