A first introduction to geometric complexity theory

Dr. Christian Ikenmeyer


Course description

Geometric complexity theory is an ambitious program initiated in 2001 by Mulmuley and Sohoni towards solving the famous P vs NP problem. The idea is to use algebraic geometry and representation theory to prove complexity lower bounds for explicit problems. There has been a significant amount of research activity in this direction during the last few years.

In this course we will give short introductions to algebraic complexity theory, to basic algebraic geometry, and to classical representation theory. The goal is to give a first introduction to geometric complexity theory.

Time and date

Summer semester 2018,




There will be oral exams at the end of the semenster (several dates are available).


There will be weekly assignments. You need to obtain half of the points to be admitted to the exam.


We follow subsets of last year's lecture notes.

The library has a "Semesterapparat" for this lecture, where several books are available that can be used as additional resources.