Algorithmic Applications of Log-Concave Polynomials and High-Dimensional Expanders

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


Duration: 53:43
621 views
8

Kuikui Liu (University of Washington)
https://simons.berkeley.edu/talks/tbd-36
Beyond Randomized Rounding and the Probabilistic Method



Other Videos By Simons Institute for the Theory of Computing


2019-03-04Hybrid Legal-Technical Concepts of Privacy
2019-03-04Smooth Sensitivity for k-Nearest Neighbor
2019-03-04Consistency with External Knowledge: The TopDown Algorithm
2019-03-04Stepping-up: The Census Bureau Sets an Example of How to Be a Good Data Steward in the 21st Century
2019-02-15Zonotopal Algebra, Graph Enumeration, and Partition Functions of Statistical Mechanics
2019-02-15Scaling Problems and Deterministic Approximation of Capacity and of the Brascamp-Lieb Constant
2019-02-15An Undetermined Matrix Moment Problem and Its Application to Computing Zeros of L-functions
2019-02-14On the Second Largest Singular Value of Non-commutative Polynomials in Random Permutations
2019-02-14Enumeration and Randomized Constructions of Hypertrees
2019-02-14Of Triangles and Intersections
2019-02-14Algorithmic Applications of Log-Concave Polynomials and High-Dimensional Expanders
2019-02-13The Geometry of Matroids
2019-02-13Completely log-concave Polynomials in Theory and Applications
2019-02-13The Space of Lorentzian Polynomials
2019-02-12Open Problems 1
2019-02-12Problems and Progress in Algorithmic Discrepancy
2019-02-12Central Limit Theorems from the Location of Roots of Probability Generating Functions
2019-02-12A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers...
2019-02-12Finite Free Cumulants
2019-02-11Developments with b− and q− Finite Free Convolutions
2019-02-11On the Further Structure of the Finite Free Convolutions


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Beyond Randomized Rounding and the Probabilistic Method
Kuikui Liu