Playlist: 26 videos Workshops

Geometric Complexity Theory

Sept. 15 – Sept. 19, 2014

Geometric Complexity Theory seeks to address fundamental complexity lower bound questions such as P versus NP by means of algebraic geometry and representation theory. There has recently been a burst of activity in these...

0:57:2

A Survey of Counting Dichotomies and Holographic Algorithms

Jin-Yi Cai, University of Wisconsin-Madison
Geometric Complexity Theory
http://simons.berkeley.edu/talks/jin-yi-cai-2014-09-17
Visit talk page
0:47:36

Approximate Counting via Correlation Decay

Pinyan Lu, Microsoft Research
Geometric Complexity Theory
http://simons.berkeley.edu/talks/pinyan-lu-2014-09-17
Visit talk page
0:57:31

Asymptotic Spectra: Old and New Insights

Markus Bläser, Universität des Saarlandes
Geometric Complexity Theory
http://simons.berkeley.edu/talks/markus-blaser-2014-09-17
Visit talk page
1:1:34

Approaches to Bounding the Exponent of Matrix Multiplication

Chris Umans, California Institute of Technology
Geometric Complexity Theory
http://simons.berkeley.edu/talks/chris-umans-2014-09-17
Visit talk page
0:43:28

Geometric Complexity Theory and Tensor Rank

Christian Ikenmeyer, Texas A&M University
Geometric Complexity Theory
http://simons.berkeley.edu/talks/christian-ikenmeyer-2014-09-17
Visit talk page
1:6:21

A Study of the Representations Supported by the Orbit Closure of the Determinant

Shrawan Kumar, University of North Carolina at Chapel Hill
Geometric Complexity Theory
http://simons.berkeley.edu/talks/shrawan-kumar-2014-09-18
Visit talk page
0:56:11

Dealing with Orbit Closures in Representations with Finitely Many Orbits

Jerzy Weyman, University of Connecticut
Geometric Complexity Theory
http://simons.berkeley.edu/talks/jerzy-weyman-2014-09-18
Visit talk page
0:42:24

Fano Schemes of Determinants and Permanents

Nathan Ilten, Simon Fraser University
Geometric Complexity Theory
http://simons.berkeley.edu/talks/nathan-ilten-2014-09-18
Visit talk page
0:57:23

Essentially Optimal Interactive Certificates in Linear Algebra

Erich Kaltofen, North Carolina State University
Geometric Complexity Theory
http://simons.berkeley.edu/talks/erich-kaltofen-2014-09-18
Visit talk page
0:56:14

A Survey of Recent Results on Depth Reduction and Lower Bounds for Arithmetic Circuits

Neeraj Kayal, Microsoft Research India
Geometric Complexity Theory
http://simons.berkeley.edu/talks/neeraj-kayal-2014-09-18
Visit talk page