Computational Complexity and Algebraic Geometry
Recently there has been an interest in using methods of algebraic geometry and representation theory to study how difficult a certain problem is from the computational point of view. These methods can be used to provide lower and upper bounds for various problems. Specifically, we will look at the problem of complexity of matrix multiplication as well as a geometric variant of P vs. NP problem.
Lecturer
Date
4th March ~ 8th May, 2024
Location
| Weekday | Time | Venue | Online | ID | Password |
|---|---|---|---|---|---|
| Monday,Wednesday,Friday | 15:00 - 16:30 | A3-2-301 | ZOOM 09 | 230 432 7880 | BIMSA |
Reference
Landsberg. Geometry and Complexity Theory.
Video Public
Yes
Notes Public
Yes
Language
English
Lecturer Intro
I have MSc degree in Applied Math / Computer Science from St. Petersburg IFMO and PhD in pure mathematics from Yale University. From 2014 to 2022 I held postdoctoral and visiting researcher positions in Japan, UK, Germany and France. I've joined BIMSA in 2023.
My current research interests include geometric representation theory, super groups and non-commutative algebraic geometry.