New Fast Algorithms for Matrix Operations
From MaRDI portal
Publication:3891765
DOI10.1137/0209027zbMath0446.68034MaRDI QIDQ3891765
Publication date: 1980
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0209027
68Q25: Analysis of algorithms and problem complexity
Related Items
Optimization techniques for small matrix multiplication, On the synthesis of fast algorithms for signal processing, The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations, Relations between exact and approximate bilinear algorithms. Applications, The bit-operation complexity of matrix multiplication and of all pair shortest path problem, On the algorithmic complexity of associative algebras, New combinations of methods for the acceleration of matrix multiplication, Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication, Computing lower bounds on tensor rank over finite fields, Fast matrix multiplication without APA-algorithms, On the asymptotic complexity of rectangular matrix multiplication, Randomised algorithms, Two new algorithms for matrix multiplication and vector convolution
