Condition
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=jAOdVVOA-_8
Peter Bürgisser, University of Berlin
Algebraic Geometry Boot Camp
http://simons.berkeley.edu/talks/peter-burgisser-2014-09-05
Other Videos By Simons Institute for the Theory of Computing
2014-09-19 | Plethysm and Lattice Point Counting |
2014-09-19 | Tutorial 4: GCT and Matrix Multiplication |
2014-09-19 | Dealing with Orbit Closures in Representations with Finitely Many Orbits |
2014-09-19 | Matrix Rank – Extensions, Applications and Open Problems |
2014-09-19 | Approximate Counting via Correlation Decay |
2014-09-19 | A Survey of Counting Dichotomies and Holographic Algorithms |
2014-09-19 | Geometric Complexity Theory and Tensor Rank |
2014-09-19 | Geometry, Invariants, and the Elusive Search for Complexity Lower Bounds |
2014-09-12 | Matrix Rigidity |
2014-09-12 | Writing Down Polynomials via Representation Theory II |
2014-09-12 | Condition |
2014-09-12 | Tensor Decomposition II |
2014-09-12 | Matrix Multiplication |
2014-09-12 | Real Algebraic Geometry |
2014-09-12 | Matrix Factorizations |
2014-09-12 | Solving Polynomials II |
2014-09-12 | Writing Down Polynomials via Representation Theory I |
2014-09-12 | Tensors vs Entanglement |
2014-09-12 | Introduction to Geometric Complexity Theory II |
2014-09-12 | Circuits of Bounded Depth |
2014-09-12 | Tensor Decomposition I |
Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Algorithms and Complexity in Algebraic Geometry
Peter Bürgisser