Additive Structure of Sets of Fourier Coefficients

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


Duration: 1:02:35
665 views
10

Thomas Bloom, University of Bristol
https://simons.berkeley.edu/talks/tom-bloom-2017-4-11
Structure vs. Randomness



Other Videos By Simons Institute for the Theory of Computing


2017-04-27How the Web Has Transformed Science and Technology Reporting
2017-04-26Machine Learning Today and Tomorrow: A Panel Discussion
2017-04-14True Complexity of Multilinear Systems
2017-04-14Unavoidable Patterns in Words
2017-04-13Labeling the Complete Bipartite Graph with No Zero Cycles
2017-04-13Positional Games and Randomness
2017-04-12Random High-Dimensional Combinatorial Objects
2017-04-12Hidden Irregularity Versus Hidden Structure: The Emergence of the Johnson Graphs
2017-04-12Hidden Irregularity Versus Hidden Structure: The Emergence of the Johnson Graphs
2017-04-11On Structural Properties of Low Threshold Rank Graphs
2017-04-11Additive Structure of Sets of Fourier Coefficients
2017-04-11Vinogradov's Three Primes Theorem with Primes from Special Sets
2017-04-11The Entropy Decrement Method and the Erdos Discrepancy Problem
2017-04-10Sparse Dense Dichotomy and Liquid Graphs
2017-04-10Trading Information Complexity for Error
2017-04-10Large Deviations for Arithmetic Progressions
2017-04-10Sum of Squares Lower Bounds for Refuting Any CSP
2017-04-10Algorithmic Dense Model Theorems and Weak Regularity
2017-04-04In Pursuit of Structure: Why a Little Randomness (Almost) Always Helps
2017-03-31Spotlght Talk: Performance Guarantees for Transferring Representations
2017-03-31Word Representation Learning without unk Assumptions


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Structure vs. Randomness
Thomas Bloom