A refined laser method and faster matrix multiplication
From MaRDI portal
Cites work
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- A \(2\mathbf{n}^2-\log_2(\mathbf{n})-1\) lower bound for the border rank of matrix multiplication
- A note on border rank
- Barriers for fast matrix multiplication from irreversibility
- Fast matrix multiplication using coherent configurations
- Fast matrix multiplication: limitations of the Coppersmith-Winograd method (extended abstract)
- Further limitations of the known approaches for matrix multiplication
- Gaussian elimination is not optimal
- Geometric complexity theory and tensor rank
- Graph implementations for nonsmooth convex programs
- scientific article; zbMATH DE number 7788370 (Why is no real title available?)
- Improved bound for complexity of matrix multiplication
- Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor
- Irreversibility of structure tensors of modules
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
- Limits on the universal method for matrix multiplication
- Lower Bounds for Matrix Product
- Matrix multiplication via arithmetic progressions
- Matrix multiplication via matrix groups
- Multiplying matrices faster than coppersmith-winograd
- New bounds for matrix multiplication: from alpha to omega
- New Fast Algorithms for Matrix Operations
- New lower bounds for the border rank of matrix multiplication
- New lower bounds for the rank of matrix multiplication
- On cap sets and the group-theoretic approach to matrix multiplication
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On sunflowers and matrix multiplication
- On the Asymptotic Complexity of Matrix Multiplication
- On the Complexity of Matrix Product
- Partial and Total Matrix Multiplication
- Powers of tensors and fast matrix multiplication
- Rank and optimal computation of generic tensors
- Relative bilinear complexity and matrix multiplication.
- Slice rank of block tensors and irreversibility of structure tensors of algebras
- Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
- The growth of tri-colored sum-free sets
Cited in
(8)- The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths
- Vertex connectivity in poly-logarithmic max-flows
- On lifting lower bounds for noncommutative circuits using automata
- Improved algorithms for perfect graphs and odd holes
- Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth
- The complexity of envy-free graph cutting
- Fair short paths in vertex-colored graphs
This page was built for publication: A refined laser method and faster matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601301)
