#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2003

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (2)

#### Publication Type

#### Journals and Conferences

#### Key Phrases

Learn More

- Vladimir P. Burichenko
- ArXiv
- 2014

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)

- Vladimir P. Burichenko
- ArXiv
- 2015

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 S3 × Z2 and S4 for Hopcroft anf Laderman… (More)

- Vladimir P. Burichenko
- Eur. J. Comb.
- 2003

- ‹
- 1
- ›