https://medium.com/@kilichbekhaydarov/toward-an-optimal-matrix-multiplication-algorithm-4f024baa1206

How fast can we multiply two n × n matrices?

A fundamental problem in theoretical computer science is to determine the time complexity of Matrix Multiplication, one of the most basic linear algebraic operations. Matrix multiplication plays an important role in physics, engineering, computer science, and other fields. It is used as a subroutine in many computational problems.