7 citations · 12 across the 4 of their papers we have counts for
4 papers · 1 filter
A Fast Search Algorithm for <m,m,m> Triple Product Property Triples and an Application for 5x5 Matrix Multiplication
Sarah Hart, Ivo Hedtke, Matthias Müller-Hannemann +1
We present a new fast search algorithm for <m,m,m> Triple Product Property (TPP) triples as defined by Cohn and Umans in 2003. The new algorithm achieves a speed-up factor of 40 up…
Search and test algorithms for Triple Product Property triples
Ivo Hedtke, Sandeep Murthy
In 2003 COHN and UMANS introduced a group-theoretic approach to fast matrix multiplication. This involves finding large subsets of a group satisfying the Triple Product Propert…
A Short Note on Disjointness Conditions for Triples of Group Subsets Satisfying the Triple Product Property
Sandeep Murthy
We deduce some elementary pairwise disjointness and semi-disjointness conditions on triples of subsets in arbitrary groups satisfying the so-called triple product property (TPP) as…
Group-theoretic Methods for Bounding the Exponent of Matrix Multiplication
Sandeep Murthy
The (asymptotic) complexity of matrix multiplication (over the complex field) is measured by a real parameter w > 0, called the exponent of matrix multiplication (over the complex…