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

Cites work

Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
Gaussian elimination is not optimal
scientific article; zbMATH DE number 3628385 (Why is no real title available?)

Cited in

(79)

Fast arithmetic for triangular sets: from theory to practice
Rank and optimal computation of generic tensors
Upper bounds on the complexity of solving systems of linear equations
Typical tensorial rank
Polynomial division and its computational complexity
A fast numerical algorithm for the composition of power series with complex coefficients
The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented algorithms
Matrix structures in parallel matrix computations
On the order of approximation in approximative triadic decompositions of tensors
The numerical instability of Bini's algorithm
Complexity measures for matrix multiplication algorithms
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
Reply to the paper The numerical instability of Bini's algorithm
Fast matrix multiplication without APA-algorithms
On the asymptotic complexity of rectangular matrix multiplication
Fast rectangular matrix multiplication and applications
On the complexity of the multiplication of matrices of small formats
Tensor decomposition and homotopy continuation
Beyond the Alder-Strassen bound.
The matrix capacity of a tensor
Equivalent polyadic decompositions of matrix multiplication tensors
On the relationship between p-dominance and stochastic stability in network games
Fast commutative matrix algorithms
On the closedness and geometry of tensor network state sets
An introduction to the computational complexity of matrix multiplication
Unifying known lower bounds via geometric complexity theory
A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
Fast hybrid matrix multiplication algorithms
Maximal bilinear complexity and codes
Learning algebraic models of quantum entanglement
The bilinear complexity and practical algorithms for matrix multiplication
On the nuclear norm and the singular value decomposition of tensors
Two new algorithms for matrix multiplication and vector convolution
Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations
Speedup of linear stationary iteration processes in multiprocessor computers. I
The border rank of the multiplication of 2\times 2 matrices is seven
On the arithmetic complexity of Strassen-like matrix multiplications
Geometry and the complexity of matrix multiplication
Fast matrix multiplication and its algebraic neighbourhood
On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
On best rank-\(2\) and rank-\((2,2,2)\) approximations of order-\(3\) tensors
On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication
Further limitations of the known approaches for matrix multiplication
Slice rank of block tensors and irreversibility of structure tensors of algebras
scientific article; zbMATH DE number 7561749 (Why is no real title available?)
A Rank 18 Waring Decomposition of sM_〈3〉 with 432 Symmetries
Tensors in computations
Symmetric tensor decomposition
Skew-polynomial-sparse matrix multiplication
Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\)
Partial Degeneration of Tensors
On the closures of monotone algebraic classes and variants of the determinant
On the generic and typical ranks of 3-tensors
On the closures of monotone algebraic classes and variants of the determinant
A refined laser method and faster matrix multiplication
Complex matrix inversion via real matrix inversions
The tensor Rank of \(5 \times 5\) matrices multiplication is bounded by 98 andits border Rank by 89
Tensor rank and complexity
Geometric complexity theory for product-plus-power
Fixed-parameter debordering of Waring rank
Homogeneous algebraic complexity theory and algebraic formulas
On matrix multiplication and polynomial identity testing
Matrix multiplication reductions
Symmetric powers: structure, smoothability, and applications
Decompositions of powers of quadrics
Correction of ‘ J. Laderman, V. Pan, X.–H. Sha, On practical Algorithms for Accelerated Matrix Multiplication, Linear Algebra and its Applications. Vol. 162-164 (1992) pp. 557-588 ’
Asymptotic spectra: theory, applications, and extensions
Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth
A simplified reduction for error correcting matrix multiplication algorithms
A note on border rank
On commutativity and approximation
The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations
On the approximate bilinear complexity of matrix multiplication
Fast rectangular matrix multiplication and some applications

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)