Circuits of Bounded Depth

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


Duration: 1:31:09
304 views
0

Klim Efremenko, Tel Aviv University
Algebraic Geometry Boot Camp
http://simons.berkeley.edu/talks/klim-efremenko-2014-09-02



Other Videos By Simons Institute for the Theory of Computing


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
2014-09-05Electrical Flows, Optimization, and New Approaches to the Maximum Flow Problem I: Electrical Flows a
2014-09-05Laplacian Systems and Electrical Flows I: Intro to Laplacian Systems, Iterative Methods, and Precond
2014-09-05Laplacian Systems and Electrical Flows II: Solving Laplacian Systems Using Recursive Preconditioning
2014-09-05Graph Sparsification I: Sparsification via Effective Resistances


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