Counting and Optimization Using Stable Polynomials
724 views · Published 8 November 2017 · 1:06:43 · Indexed 29 October 2026
Channel: Simons Institute for the Theory of Computing · 2017 · Education
Nima Anari, Stanford University https://simons.berkeley.edu/talks/nima-anari-11-8-17 Hierarchies, Extended Formulations and Matrix-Analytic Techniques
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