On the Asymptotic Complexity of Matrix Multiplication

Cited in

(62)

Fast rectangular matrix multiplication and applications
Upper bounds on the complexity of solving systems of linear equations
scientific article; zbMATH DE number 7559388 (Why is no real title available?)
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
On computation of the Bessel function by summing up the series
On the order of approximation in approximative triadic decompositions of tensors
scientific article; zbMATH DE number 7689792 (Why is no real title available?)
The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented algorithms
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic
Equivalent polyadic decompositions of matrix multiplication tensors
A note on border rank
Bad and good news for Strassen's laser method: border rank of \(\mathrm{Perm}_3\) and strict submultiplicativity
Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field
Computing dominators in parallel
The 1982 ACM Turing Award lecture. An overview of computational complexity
Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
Fast matrix multiplication and its algebraic neighbourhood
Matrix multiplication via arithmetic progressions
On-line computation of transitive closures of graphs
A note on VNP-completeness and border complexity
Further limitations of the known approaches for matrix multiplication
Parity OBDDs cannot be handled efficiently enough
An introduction to the computational complexity of matrix multiplication
A refined laser method and faster matrix multiplication
The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations
Combinatorial analysis (nonnegative matrices, algorithmic problems)
Fast rectangular matrix multiplication and some applications
Asymptotic spectra: theory, applications, and extensions
Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
Lower bounds in algebraic computational complexity
Fast commutative matrix algorithms
Reply to the paper The numerical instability of Bini's algorithm
Discrete logarithms in \(\mathrm{GF}(p)\)
On cap sets and the group-theoretic approach to matrix multiplication
A Method to Compute Minimal Polynomials
Speedup for natural problems and noncomputability
Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
An augmenting path algorithm for linear matroid parity
Revisiting matrix squaring
Limits on the Universal method for matrix multiplication
Efficient decomposition of separable algebras.
Fast hybrid matrix multiplication algorithms
Certifying algorithms
Complex matrix inversion via real matrix inversions
A recognition algorithm for orders of interval dimension two
It's hard to HAC average linkage!
Limits on the universal method for matrix multiplication
Subquadratic-time factoring of polynomials over finite fields
The Hackbusch conjecture on tensor formats
Fast parallel algorithms for polynomial division over an arbitrary field of constants
Semi-algebraic complexity -- Additive complexity of matrix computational tasks
On commutativity and approximation
Improved lower bounds for some matrix multiplication problems
The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms
On matrix multiplication and polynomial identity testing
Very large cliques are easy to detect
A note on two-way nondeterministic pushdown automata
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
Fast matrix multiplication without APA-algorithms
Rubber bands, convex embeddings and graph connectivity

This page was built for publication: On the Asymptotic Complexity of Matrix Multiplication

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