Geometric complexity theory 2
Prof. Dr. Markus Bläser, Dr. Christian Ikenmeyer
- Upload homework 4: 2017-Nov-15, 03:00h
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
- Prof. Dr. Markus Bläser, Email: mblaeser at cs.uni-saarland...
Office Hours: whenever my office door is open, E1 3, room 412
- Dr. Christian Ikenmeyer, Email: cikenmeyer at mpi-inf.mpg.de
Office Hours: whenever my door is open, E1 4, room 311D
"Introduction to geometric complexity theory" or equivalent
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.
In lecture 1 we covered material from [ link ], Section 3.
In lecture 2 we covered material from [ link ], Sections 1-3.
In lecture 3 we covered material from [ link ], Sections 4-6.
In lecture 4 we covered material from [ link ].