New Fast Algorithms for Matrix Operations

Cited in

(24)

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
Equivalent polyadic decompositions of matrix multiplication tensors
HPMaX: heterogeneous parallel matrix multiplication using CPUs and GPUs
Two new algorithms for matrix multiplication and vector convolution
On the arithmetic complexity of Strassen-like matrix multiplications
Fast matrix multiplication and its algebraic neighbourhood
Further limitations of the known approaches for matrix multiplication
Optimization techniques for small matrix multiplication
Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
Flip Graphs for Matrix Multiplication
Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
Notions of tensor rank
A refined laser method and faster matrix multiplication
On matrix multiplication and polynomial identity testing
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

This page was built for publication: New Fast Algorithms for Matrix Operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3891765)