Upgrading Subgroup Triple-Product-Property Triples
From MaRDI portal
Publication:2828201
DOI10.1145/2699877zbMath1348.65076arXiv1107.5973OpenAlexW2044405930MaRDI QIDQ2828201
Publication date: 24 October 2016
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.5973
fast matrix multiplicationexponent of matrix multiplicationtriple product propertygroup-theoretic matrix multiplication
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- Gaussian elimination is not optimal
- Search and test algorithms for triple product property triples
- Fast Matrix Multiplication
- Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication
- A note on the triple product property for subsets of finite groups
- Powers of tensors and fast matrix multiplication
- Strassen's Matrix Multiplication Algorithm for Matrices of Arbitrary Order
- Multiplying matrices faster than coppersmith-winograd
This page was built for publication: Upgrading Subgroup Triple-Product-Property Triples
