Abstract
Schemes for exact multiplication of small matrices have a large symmetry group. This group defines an equivalence relation on the set of multiplication schemes. There are algorithms to decide whether two schemes are equivalent. However, for a large number of schemes a pairwise equivalence check becomes cumbersome. In this paper we propose an algorithm to compute a normal form of matrix multiplication schemes. This allows us to decide pairwise equivalence of a larger number of schemes efficiently.
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.