Vladimir P. Burichenko

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)
  • 1