Complexity of bilinear problems Markus Bläser

Registration for this course is open until Friday, 19.11.2021 23:59.


Currently, no news are available

Complexity of bilinear problems


Many algorithms use matrix multiplication as a subroutine. In the running times of such algorithms, one often finds a quantity w, the so called exponent of matrix multiplication. w is the infimum over all numbers t such that we can multiply n x n matrices in time n^t. We currently know that w < 2.373. While often used (at least in theory), only very few researchers know how these algorithms work.

We give an overview of the developments of fast algorithms for matrix multiplication. Along the way, we look at some other fundamental problems in algebraic complexity like polynomial evaluation.

This is a 6 CP specialized lecture. It will be online.


Time and Date:

  • Monday, 10:15 - 12:00 (online)
  • Thursday 12:15 - 14:00 (online)
  • First lecture: Thursday, October 21

Lectures are live and will be recorded. The recordings will be made available after the lecture. The Zoom links will be posted under "Materials".



Every second Thursday, there will be a tutorial instead of a lecture.



There will be bi-weekly assignments. To be admitted to the exam, you have to achieve half the points in the assignments. You can submit assignments in groups of up to three persons.



There will be oral exams at the end of the semester.



Profound knowledge of linear algebra is very helpful.


Privacy Policy | Legal Notice
If you encounter technical problems, please contact the administrators