Approximate Degree and Quantum Query Lower Bounds via Dual Polynomials

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


Duration: 36:46
420 views
6

Mark Bun (Princeton University)
https://simons.berkeley.edu/talks/tbd-15
Boolean Devices



Other Videos By Simons Institute for the Theory of Computing


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
2018-09-13A Survey on MCSP
2018-09-12Clique Is Hard on Average for Regular Resolution
2018-09-12Fooling Polytopes
2018-09-12An Overview of Quantified Derandomization
2018-09-11Locating Linear Decision Lists within TC^0
2018-09-11Monotone Circuit Lower Bounds from Resolution (Now with Applications!)
2018-09-11BPP Lifting and Its Applications
2018-09-11Approximate Degree and Quantum Query Lower Bounds via Dual Polynomials
2018-09-11Algorithmic Polynomials
2018-09-11Lifting Nullstellensatz Degree to Monotone Span Program Size
2018-09-10Static Data Structure Lower Bounds Imply Rigidity
2018-09-10Lower Bounds for Unrestricted Boolean Circuits: Open Problems
2018-09-10Oracle Separation of BQP and the Polynomial Hierarchy
2018-09-10Pseudorandom Generators from Polarizing Random Walks
2018-09-10The KRW Conjecture: Results and Open Problems
2018-09-10Circuit Lower Bounds (and More) via the Fusion Method
2018-09-07Networking Theory: A Personal Perspective
2018-09-07Emerging Trends & Applications in Communication Networks


Tags:
Boolean Devices
Mark Bun
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley