Abstract
In 2003 COHN and UMANS introduced a group-theoretic approach to fast matrix multiplication. This involves finding large subsets S, T and U of a group G satisfying the Triple Product Property (TPP) as a means to bound the exponent of the matrix multiplication. We show that S, T and U may be be assumed to contain the identity and be otherwise disjoint. We also give a much shorter proof of the upper bound |S|+|T|+|U| <= |G|+2.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.