Seminar:
Spring 2016, Thursdays, Blocker 506A, 4:00-4:50 PM
Date: March 3
Christian Ikenmeyer
Abstract
Geometric complexity theory is an approach towards fundamental computational complexity lower bounds in theoretical computer science. We give an introduction to the famous $1,000,000 P vs NP problem, Valiant's algebraization approach, and Mulmuley and Sohoni's geometrization, which introduces representation theory to the problem.