Geometry, Invariants, and the Elusive Search for Complexity Lower Bounds

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=Snu99Ek_lRI


Duration: 1:04:36
416 views
3

Peter Bürgisser, Technical University of Berlin
Simons Institute Open Lectures
http://simons.berkeley.edu/events/openlectures2014-fall-1



Other Videos By Simons Institute for the Theory of Computing


2014-09-19Hilbert Functions, Shallow Circuits, and Other Approaches to GCT
2014-09-19Fano Schemes of Determinants and Permanents
2014-09-19Tutorial 5: The GCT Chasm II
2014-09-19Plethysm and Lattice Point Counting
2014-09-19Tutorial 4: GCT and Matrix Multiplication
2014-09-19Dealing with Orbit Closures in Representations with Finitely Many Orbits
2014-09-19Matrix Rank – Extensions, Applications and Open Problems
2014-09-19Approximate Counting via Correlation Decay
2014-09-19A Survey of Counting Dichotomies and Holographic Algorithms
2014-09-19Geometric Complexity Theory and Tensor Rank
2014-09-19Geometry, Invariants, and the Elusive Search for Complexity Lower Bounds
2014-09-12Matrix Rigidity
2014-09-12Writing Down Polynomials via Representation Theory II
2014-09-12Condition
2014-09-12Tensor Decomposition II
2014-09-12Matrix Multiplication
2014-09-12Real Algebraic Geometry
2014-09-12Matrix Factorizations
2014-09-12Solving Polynomials II
2014-09-12Writing Down Polynomials via Representation Theory I
2014-09-12Tensors vs Entanglement


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Peter Bürgisser