Improved bound for complexity of matrix multiplication
From MaRDI portal
Publication:2837114
DOI10.1017/S0308210511001648zbMath1276.65024OpenAlexW2075577372WikidataQ56672112 ScholiaQ56672112MaRDI QIDQ2837114
Alexander M. Davie, A. J. Stothers
Publication date: 10 July 2013
Published in: Proceedings of the Royal Society of Edinburgh: Section A Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0308210511001648
Related Items
Fast commutative matrix algorithms, A linear time algorithm for the nullity of vertex-weighted block graphs, Allowing cycles in discrete Morse theory, Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps, Efficient computation of tridiagonal matrices largest eigenvalue, Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter, Irreversibility of structure tensors of modules, Parameterized complexity of determinant and permanent, Fast matrix multiplication and its algebraic neighbourhood, Further Limitations of the Known Approaches for Matrix Multiplication, Efficient computation of the characteristic polynomial of a threshold graph, On cap sets and the group-theoretic approach to matrix multiplication, Unnamed Item, Unnamed Item, A numerical solution for Laplace and Poisson's equations using geometrical transformation and graph products, Limits on the Universal method for matrix multiplication, Geometric adaptive Monte Carlo in random environment, Unnamed Item, Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses, Unnamed Item, Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication, Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
