A PSPACE Construction of a Hitting Set for the Closure of Small Algebraic Circuits
428 views · Published 6 December 2018 · 49:08 · Indexed 1 October 2026
Channel: Simons Institute for the Theory of Computing · 2018 · Education
Michael Forbes (University of Illinois at Urbana-Champaign) https://simons.berkeley.edu/talks/michael Algebraic Methods
More from this channel
-
27:28
The Query Complexity of Correlated Equilibria
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
29:08
An Isomorphism Between Parameterized Complexity and Classical Complexity, for both Time and Space
-
33:14
Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse
-
45:30
Informational Substitutes and Complements for Prediction
-
50:56
Incentive Auctions and Spectrum Repacking
-
23:27
Which Regular Expression Patterns are Hard to Match?
-
49:09
Optimal Data-Dependent Hashing for Nearest Neighbor Search