Fast Exact Algorithms Using Hadamard Product of Polynomials

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


Duration: 52:14
932 views
8

Vikraman Arvind (Institute of Mathematical Sciences)
https://simons.berkeley.edu/talks/arvind
Algebraic Methods



Other Videos By Simons Institute for the Theory of Computing


2019-01-23The Barrier Method and the Kadison-Singer Problem - B
2019-01-22Ramanujan Graphs, Treelike Walks, and Mixed Characteristic Polynomials - A
2019-01-22Ramanujan Graphs, Treelike Walks, and Mixed Characteristic Polynomials - B
2019-01-22The Method of Interlacing Polynomials - B
2019-01-22The Method of Interlacing Polynomials - A
2019-01-22Real Stable Polynomials, Strongly Rayleigh Distributions, and Applications, Part I-B
2019-01-22Real Stable Polynomials, Strongly Rayleigh Distributions, and Applications, Part I-A
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


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Algebraic Methods
Vikraman Arvind