Fast matrix multiplication without APA-algorithms
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3688713 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3461412 (Why is no real title available?)
- scientific article; zbMATH DE number 3628385 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- scientific article; zbMATH DE number 3412083 (Why is no real title available?)
- Algebras Having Linear Multiplicative Complexities
- Gaussian elimination is not optimal
- New Fast Algorithms for Matrix Operations
- New combinations of methods for the acceleration of matrix multiplication
- On the Asymptotic Complexity of Matrix Multiplication
- On the optimal evaluation of a set of bilinear forms
- Partial and Total Matrix Multiplication
- Relations between exact and approximate bilinear algorithms. Applications
- The Computational Complexity of Continued Fractions
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
Cited in
(2)
This page was built for publication: Fast matrix multiplication without APA-algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1168050)