Hardness Amplification and the Approximate Degree of Constant-Depth Circuits

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


Duration: 47:13
264 views
3

Justin Thaler, Harvard University
Neo-Classical Methods in Discrete Analysis
http://simons.berkeley.edu/talks/justin-thaler-2013-12-05



Other Videos By Simons Institute for the Theory of Computing


2013-12-17DP-WHERE: Differentially Private Modeling of Human Mobility
2013-12-17Tutorial on Differential Privacy
2013-12-17Musings on False Discovery Rate
2013-12-17Selective Inference and False Discovery Rate II
2013-12-17Selective Inference and False Discovery Rate I
2013-12-12Clustering -- Does Theory Help?
2013-12-12Vertical Versus Horizontal Poincare Inequalities
2013-12-12Discrete Tori and Bounds for Linear Codes
2013-12-12Some Pseudorandom Phenomena in Finite Fields
2013-12-12Partial Difference Equations Over Compact Abelian Groups
2013-12-12Hardness Amplification and the Approximate Degree of Constant-Depth Circuits
2013-12-12Laplacian Eigenvalues, Metric Uniformization, and Incidence Geometry
2013-12-12Incidence Geometry and Applications to Theoretical Computer Science
2013-12-12Counting Sumsets and Applications
2013-12-12The Structure of Low Rank Matrices
2013-12-12Building Monotone Expanders
2013-12-12Small Lifts of Expander Graphs are Expanding
2013-12-12Non-commutative Computation
2013-12-12Undecidability of Linear Inequalities Between Graph Homomorphism Densities
2013-12-12Ultraproducts as a Bridge Between Discrete and Continuous Analysis
2013-12-12Algorithmic Regularity for Polynomials and Applications


Tags:
Simons Institute
Real Analysis
UC Berkeley
computer science
theory of computing
Justin Thaler