Finite matrix multiplication algorithms from infinite groups
From MaRDI portal
No records found.
Cites work
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- A group-theoretic approach to fast matrix multiplication
- Barriers for fast matrix multiplication from irreversibility
- Fast matrix multiplication: limitations of the Coppersmith-Winograd method (extended abstract)
- Faster matrix multiplication via asymmetric hashing
- Gaussian elimination is not optimal
- scientific article; zbMATH DE number 1683516 (Why is no real title available?)
- scientific article; zbMATH DE number 51906 (Why is no real title available?)
- scientific article; zbMATH DE number 1822312 (Why is no real title available?)
- scientific article; zbMATH DE number 7788370 (Why is no real title available?)
- Improved bound for complexity of matrix multiplication
- Lie groups. A problem-oriented introduction via matrix groups
- Lie groups. An approach through invariants and representations
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
- Matrix multiplication via arithmetic progressions
- Matrix multiplication via matrix groups
- Multiplying matrices faster than coppersmith-winograd
- Near optimal bounds for the Erdős distinct distances problem in high dimensions
- New bounds for matrix multiplication: from alpha to omega
- On cap sets and the group-theoretic approach to matrix multiplication
- Partial and Total Matrix Multiplication
- Powers of tensors and fast matrix multiplication
- Relations between exact and approximate bilinear algorithms. Applications
- Symmetry, Representations, and Invariants
- The asymptotic spectrum of tensors.
This page was built for publication: Finite matrix multiplication algorithms from infinite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296648)
