Saarland University
Department of Computer Science
Computational Complexity
Computational Complexity




Fast Matrix Multiplication

Prof. Dr. Markus Bläser


Since almost nobody participated in the doodle poll, there will be no lecture this week (May 9).

Because I am travelling next week, there will be no lecture next week (May 16)

So I have a total of two lectures on account that I may spent in the future :-)

Please do not forget to register for this course (HISPOS)


In 1969, Strassen found a new way to multiply matrices with O(n^2.81) arithmetic operations. While one usually learns this result in a standard algorithms course, the subsequent improvements - with the current world record being O(n^2.37) - are much more complicated, but even more astonishing, After this course, you will understand how the currently best algorithms for matrix multiplication work.

Time & Date

  • Thursdays, 10:15 to 12:00, in E1.3, seminar room 16
  • Lecturer


    Good knowledge in linear algebra. (Mathematics for computer scientists 1-3 is sufficient.)


    Oral exams at the end of the course