#### Filter Results:

#### Publication Year

2003

2015

#### Key Phrase

#### Publication Venue

Learn More

We consider the famous Strassen algorithm for fast multiplication of matrices. We show that this algorithm has a nontrivial finite group of automorphisms of order 36 (namely the direct product of two copies of the symmetric group on 3 symbols), or even 72, if we consider " extended " Strassen algorithm. This is an indirect evidence that the (unknown at… (More)

In this work the algorithms of fast multiplication of matrices are considered. To any algorithm there associated a certain group of automorphisms. These automorphism groups are found for some well-known algorithms, including algorithms of Hopcroft, Laderman, and Pan. The automorphism group is isomorphic to S 3 × Z 2 and S 4 for Hopcroft anf Laderman… (More)

- ‹
- 1
- ›