0(n^2.7799) complexity for n n approximate matrix multiplication

Cites Work

Gaussian elimination is not optimal
Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
Title not available (Why is that?)

Cited In (67)

Geometry and the complexity of matrix multiplication
Fast rectangular matrix multiplication and applications
Upper bounds on the complexity of solving systems of linear equations
On the order of approximation in approximative triadic decompositions of tensors
The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented $\lambda$ algorithms
A bilinear algorithm of length $22$ for approximate multiplication of $2\times 7$ and $7\times 2$ matrices
The bit-operation complexity of matrix multiplication and of all pair shortest path problem
Equivalent polyadic decompositions of matrix multiplication tensors
Speedup of linear stationary iteration processes in multiprocessor computers. I
A note on border rank
Complexity measures for matrix multiplication algorithms
Tensors in computations
Fast matrix multiplication and its algebraic neighbourhood
On the closedness and geometry of tensor network state sets
Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
On the generic and typical ranks of 3-tensors
The bilinear complexity and practical algorithms for matrix multiplication
On the asymptotic complexity of rectangular matrix multiplication
Further limitations of the known approaches for matrix multiplication
On the algorithmic complexity of associative algebras
Matrix structures in parallel matrix computations
Symmetric tensor decomposition
On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication
On the nuclear norm and the singular value decomposition of tensors
An introduction to the computational complexity of matrix multiplication
The border rank of the multiplication of $2\times 2$ matrices is seven
The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations
Fast rectangular matrix multiplication and some applications
The numerical instability of Bini's algorithm
Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
Fast commutative matrix algorithms
Reply to the paper The numerical instability of Bini's algorithm
Unifying known lower bounds via geometric complexity theory
New combinations of methods for the acceleration of matrix multiplication
Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations
Fast hybrid matrix multiplication algorithms
On the exact and approximate bilinear complexities of multiplication of $4\times 2$ and $2\times 2$ matrices
Typical tensorial rank
Beyond the Alder-Strassen bound.
On the arithmetic complexity of Strassen-like matrix multiplications
A Rank 18 Waring Decomposition of sM_〈3〉 with 432 Symmetries
Tensor decomposition and homotopy continuation
On the relationship between $p$-dominance and stochastic stability in network games
The matrix capacity of a tensor
On the approximate bilinear complexity of matrix multiplication
The approximate bilinear complexity of the multiplication of matrices of sizes $2\times n$ and $n\times 4$
On best rank-$2$ and rank-$(2,2,2)$ approximations of order-$3$ tensors
A fast numerical algorithm for the composition of power series with complex coefficients
Relations between exact and approximate bilinear algorithms. Applications
On commutativity and approximation
On the complexity of the multiplication of matrices of small formats
Title not available (Why is that?)
Rank and optimal computation of generic tensors
Fast matrix multiplication without APA-algorithms
Polynomial division and its computational complexity
Fast arithmetic for triangular sets: from theory to practice
Maximal bilinear complexity and codes
Title not available (Why is that?)
On the closures of monotone algebraic classes and variants of the determinant
On the closures of monotone algebraic classes and variants of the determinant
Skew-polynomial-sparse matrix multiplication
A refined laser method and faster matrix multiplication
Two new algorithms for matrix multiplication and vector convolution
Complex matrix inversion via real matrix inversions
Learning algebraic models of quantum entanglement
The tensor Rank of $5 \times 5$ matrices multiplication is bounded by 98 andits border Rank by 89
Partial Degeneration of Tensors

This page was built for publication: $0(n^{2.7799})$ complexity for $n\times n$ approximate matrix multiplication

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