The Coin Problem and AC^0[parity]

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


Duration: 31:28
300 views
2

Srikanth Srinivasan (Indian Institute of Technology Bombay)
https://simons.berkeley.edu/talks/small-bias-requires-large-formulas
Boolean Devices



Other Videos By Simons Institute for the Theory of Computing


2018-09-25Stochastic Quasi-Gradient Methods: Variance Reduction via Jacobian Sketching
2018-09-24Why Deep Learning Works: Implicit Self-Regularization in Deep Neural Networks
2018-09-24How Randomized Analysis Can Help Us Do “Data Science:” Examples in Deep Learning and Graph Analysis
2018-09-24Reconstructing Continuous Signals via Leverage Score Sampling
2018-09-24Asympirical Analysis: Theory Informs Practice
2018-09-24Recent Advances in Positive Semidefinite Matrix Approximation
2018-09-24Advanced Techniques for Low-Rank Matrix Approximation
2018-09-24Randomized Numerical Linear Algebra: Overview
2018-09-24Randomized Least Squares Regression: Combining Model- and Algorithm-Induced Uncertainties
2018-09-14A Short List of Equalities Has Large Sign Rank
2018-09-14The Coin Problem and AC^0[parity]
2018-09-14Does Looking Inside a Circuit Help?
2018-09-14The Complexity of Distributions
2018-09-14Distribution-Free Junta Testing
2018-09-14The Pathset Approach to Formula Lower Bounds
2018-09-13Boolean Matrix Multiplication Lower Bounds
2018-09-13New Lower Bounds Through an Improved Easy Witness Lemma
2018-09-13Recent Structure Lemmas for Depth-two Threshold Circuits
2018-09-13A Review of Some Recent Lower Bounds Against Low-Depth Threshold Circuits
2018-09-13Natural Properties, MCSP, and Proving Circuit Lower Bounds
2018-09-13Hardness Magnification


Tags:
Boolean Devices
Srikanth Srinivasan
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley