Solving Polynomials II

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


Duration: 1:15:48
179 views
1

Jonathan Hauenstein, University of Notre Dame
Algebraic Geometry Boot Camp
http://simons.berkeley.edu/talks/jonathan-hauenstein-2014-09-04



Other Videos By Simons Institute for the Theory of Computing


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
2014-09-12Introduction to Geometric Complexity Theory II
2014-09-12Circuits of Bounded Depth
2014-09-12Tensor Decomposition I
2014-09-12Introduction to Geometric Complexity Theory I
2014-09-12Solving Polynomials I
2014-09-05Electrical Flows, Optimization, and New Approaches to the Maximum Flow Problem III: Maximum Flows an
2014-09-05Electrical Flows, Optimization, and New Approaches to the Maximum Flow Problem II: Approximating Max
2014-09-05Semidefinite Programming Hierarchies III: Applications of the Sum-of-Squares Method


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Algorithms and Complexity in Algebraic Geometry
Jonathan Hauenstein