Geometric complexity theory 2
Prof. Dr. Markus Bläser, Dr. Christian Ikenmeyer
News
 Uploaded new sample solutions: 2018Feb9, 16:10h
 Uploaded new lecture notes / completed old lecture notes: 2018Jan29, 17:40h
 Uploaded homework 11: 2018Jan16, 21:50h
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 and connections to tensor rank and matrix multiplication have been drawn.
In this course we discuss recent topics in geometric complexity theory.
Time and date
Winter semester 2017/2018,
 Tuesdays 14:30 to 16:00, E1.3, HS 003
 weekly Tutorials with Gorav Jindal: Tuesdays 12:00 to 13:30, E1.1, seminar room 206
Lecturers
 Prof. Dr. Markus Bläser, Email: mblaeser at cs.unisaarland...
Office Hours: whenever my office door is open, E1 3, room 412
 Dr. Christian Ikenmeyer, Email: cikenmeyer at mpiinf.mpg.de
Office Hours: whenever my door is open, E1 4, room 311D
Prerequisites

"Introduction to geometric complexity theory" or equivalent
Grading
There will be oral exams at the end of the semenster (several dates are available).
Assignments
There will be weekly assignments. You need to obtain half of the points to be admitted to the exam.
 Homework 1, Solution
 Homework 2, Solution
 Homework 3, Solution
 Homework 4, Solution
 Homework 5, Solution
 Homework 6, Solution
 Homework 7, Solution
 Homework 8, Solution
 Homework 9, Solution
 Homework 10, Solution
 Homework 11
Literature
In lecture 1 we covered material from [ link ], Section 3.
In lecture 2 we covered material from [ link ], Sections 13.
In lecture 3 we covered material from [ link ], Sections 46.
Lecture notes for lectures 4 and 5 are here: [ link ]. They are based on the paper [ link ].
Lecture notes on GCT and symmetries: [ link ].
Lecture notes on determinantal complexity: [ link ], see also Landsberg's lecture notes [ link ].