Explicit, Almost Optimal, Epsilon-Balanced Codes
659 views · Published 7 March 2017 · 1:04:49 · Indexed 8 November 2026
Channel: Simons Institute for the Theory of Computing · 2017 · Education
Amnon Ta-Shma, Tel Aviv University https://simons.berkeley.edu/talks/amnon-ta-shma-2017-03-07 Proving and Using Pseudorandomness
More from this channel
-
35:16
Probabilistic Polynomials and Hamming Nearest Neighbors
-
15:16
Addition is Exponentially Harder than Counting for Shallow Monotone Circuits
-
55:22
Thinking Algorithmically About Impossibility
-
27:28
The Query Complexity of Correlated Equilibria
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
33:01
Revenue Maximization in Interdependent Value Settings
-
34:31
Algorithmic Bayesian Mechanism Design
-
37:51
On Maximizing Revenue for Multi-Item Auctions