No article text was recorded for this version.
matrix multiplication complexity
Version 1 of 143 papers98 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
- Blog: Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method
- Blog: Further limitations of the known approaches for matrix multiplication
- Blog: Limits on the Universal Method for Matrix Multiplication
- Blog: Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
- Blog: Group-theoretic Algorithms for Matrix Multiplication
- Blog: A Refined Laser Method and Faster Matrix Multiplication
- Blog: Limits on the Universal Method for Matrix Multiplication
- Blog: New Bounds for Matrix Multiplication: from Alpha to Omega
- Blog: Slice Rank of Block Tensors and Irreversibility of Structure Tensors of Algebras
- Blog: Special Issue "Conference on Computational Complexity 2012" Guest editors' foreword
- Blog: More Asymmetry Yields Faster Matrix Multiplication
- Blog: Graph expansion and communication costs of fast matrix multiplication: regular submission
- Blog: A Refined Laser Method and Faster Matrix Multiplication
- Blog: Numerical CP decomposition of some difficult tensors
- Blog: New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms
- Blog: A Two-pronged Progress in Structured Dense Matrix Vector Multiplication.
- Blog: An improved cutting plane method for convex optimization, convex-concave games, and its applications
- Blog: Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds
- Blog: Reducing the Complexity of Matrix Multiplication to $O(N^2log_2N)$ by an Asymptotically Optimal Quantum Algorithm
- Blog: A Refined Laser Method and Faster Matrix Multiplication
- Blog: Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
- Blog: Finding Matrix Multiplication Algorithms with Classical Planning
- Blog: Equivalences between triangle and range query problems
- Blog: Algorithms, Reductions and Equivalences for Small Weight Variants of All-Pairs Shortest Paths
- Blog: Improving the Leading Constant of Matrix Multiplication
- Blog: Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths
- Blog: Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits
- Blog: Faster Algorithms for Text-to-Pattern Hamming Distances
- Blog: An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs using Fast Matrix Multiplication
- Blog: Fast Multi-Subset Transform and Weighted Sums Over Acyclic Digraphs
- Blog: The border support rank of two-by-two matrix multiplication is seven
- Blog: Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371)
- Blog: Equivalent polyadic decompositions of matrix multiplication tensors
- Blog: Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication
- Blog: Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence
- Blog: A Refined Laser Method and Faster Matrix Multiplication
- Blog: Selection in Monotone Matrices and Computing kth Nearest Neighbors
- Blog: Fast Approximate Counting of Cycles
- Blog: On Symmetric Factorizations of Hankel Matrices
- Blog: Communication-optimal Parallel and Sequential QR and LU Factorizations
- Blog: A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems
- Blog: An Illuminating Algorithm for the Light Bulb Problem
History & citation
Current · Permanent link
- The Search for Optimal Matrix Multiplication Complexity merged into this direction (55% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_matrix_multiplication_complexity_6ac3590f,
title = {matrix multiplication complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/matrix-multiplication-complexity/rdr_6ac3590fc6b14599a72c4fe6323e09ce},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_matrix_multiplication_complexity_6ac3590f_v1,
title = {matrix multiplication complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/matrix-multiplication-complexity/rdr_6ac3590fc6b14599a72c4fe6323e09ce/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}