Probabilistic Polynomials and Hamming Nearest Neighbors
716 views · Published 1 October 2015 · 35:16 · Indexed 10 November 2026
Channel: Simons Institute for the Theory of Computing · 2015 · Education
Joshua Alman, Stanford University Connections Between Algorithm Design and Complexity Theory https://simons.berkeley.edu/talks/joshua-alman-2015-10-01
More from this channel
-
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
-
32:46
How Well Do Prices Coordinate Markets