Improved bound for complexity of matrix multiplication
From MaRDI portal
Recommendations
Cited in
(34)- Bounded simultaneous messages
- scientific article; zbMATH DE number 7559388 (Why is no real title available?)
- Lower bounds on the graver complexity of M-fold matrices
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
- An extended view on lifting Gaussian Bayesian networks
- Fast matrix multiplication and its algebraic neighbourhood
- The xyz algorithm for fast interaction search in high-dimensional data
- Irreversibility of structure tensors of modules
- Further limitations of the known approaches for matrix multiplication
- Efficiently-verifiable strong uniquely solvable puzzles and matrix multiplication
- Allowing cycles in discrete Morse theory
- A refined laser method and faster matrix multiplication
- Sketching with Kerdock's crayons: fast sparsifying transforms for arbitrary linear maps
- Asymptotic spectra: theory, applications, and extensions
- scientific article; zbMATH DE number 7306903 (Why is no real title available?)
- Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter
- Fast commutative matrix algorithms
- On cap sets and the group-theoretic approach to matrix multiplication
- A linear time algorithm for the nullity of vertex-weighted block graphs
- Combinatorial and recurrent approaches for efficient matrix inversion: sub-cubic algorithms leveraging fast matrix products
- Limits on the Universal method for matrix multiplication
- Efficient computation of tridiagonal matrices largest eigenvalue
- Alternative basis matrix multiplication is fast and \(\mathrm{stable}^\dag\)
- On obtaining upper bounds on the complexity of matrix multiplication
- Limits on the universal method for matrix multiplication
- A numerical solution for Laplace and Poisson's equations using geometrical transformation and graph products
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Geometric adaptive Monte Carlo in random environment
- On matrix multiplication and polynomial identity testing
- Efficient computation of the characteristic polynomial of a threshold graph
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
- A nondegenerate \(n\)-dimensional hyperchaotic map model with application in a keyed parallel hash function
- A Lower Bound for Matrix Multiplication
- Parameterized complexity of determinant and permanent
This page was built for publication: Improved bound for complexity of matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2837114)
