Formal Series and Non-Commutative Computations

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


Duration: 27:03
313 views
5

Guillaume Malod (Université Paris Diderot)
https://simons.berkeley.edu/talks/guillaume
Algebraic Methods



Other Videos By Simons Institute for the Theory of Computing


2019-01-22Real-Rooted Polynomials (problem session)
2019-01-22Real-Rooted Polynomials
2018-12-20Berkeley in the 80s, Episode 1: Shafi Goldwasser
2018-12-07Fast Exact Algorithms Using Hadamard Product of Polynomials
2018-12-07Torus Quotients in the Grassmannian
2018-12-07Complexity of Separation of Variables and Splitting of Monomials
2018-12-07Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications
2018-12-06Near-Optimal Bootstrapping of Hitting Sets
2018-12-06Generic vs Symbolic Behaviour, and Power Series Expansion
2018-12-06Barriers for Rank Methods in Arithmetic Complexity
2018-12-06Formal Series and Non-Commutative Computations
2018-12-06Complete Derandomization of Identity Testing of Read-Once Formulas
2018-12-06PIT Questions in Invariant Theory
2018-12-06Analyzing Alternating Minimization Algorithms Using Algebraic Methods
2018-12-05Algebraic Dependence is Not Hard (& Filling the GCT Chasm)
2018-12-05A PSPACE Construction of a Hitting Set for the Closure of Small Algebraic Circuits
2018-12-05Reconstruction of Non-Degenerate Homogeneous Depth Three Circuits
2018-12-05The Edge of Physics: Crafting a Non-Fiction Narrative that Combines Science with Travel Writing
2018-12-05An Improved Depth Reduction for Syntactically Multilinear Circuits
2018-12-05Fine-Grained Algorithms and Complexity of Solving Polynomial Systems of Equations
2018-12-05Proper Learning Algorithms from Lower Bounds for Arithmetic Circuits


Tags:
Algebraic Methods
Guillaume Malod
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley