北京雁栖湖应用数学研究院

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.