|
Abstract:
In this talk I will give an introduction to Geometric Complexity
theory as an approach to separating computational complexity
classes. I will talk about the algorithmic representation theory
problems which arise in this approach. I will assume no background
and begin by introducing the important notions of completeness, in complexity
theory, and class varieties, defined in GCT. I
will illustrate the approach by considering the example of separating
the permanent class from the determinant class.
|