A fast search algorithm for \(\langle m,m,m\rangle\) Triple Product Property triples and an application for \(5\times 5\) matrix multiplication
DOI10.1515/gcc-2015-0001zbMath1328.68093DBLPjournals/gcc/HartHMM15arXiv1305.0448OpenAlexW2963175098WikidataQ57013111 ScholiaQ57013111MaRDI QIDQ2344224
Sarah B. Hart, Sandeep Murthy, Ivo Hedtke, Matthias Müller-Hannemann
Publication date: 12 May 2015
Published in: Groups, Complexity, Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.0448
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: A fast search algorithm for \(\langle m,m,m\rangle\) Triple Product Property triples and an application for \(5\times 5\) matrix multiplication
