Lower Bounds Techniques in Proof Complexity II
372 views · Published 21 August 2018 · 1:02:22 · Indexed 22 October 2026
Channel: Simons Institute for the Theory of Computing · 2018 · Education
Pavel Hrubes, Academy of Sciences of the Czech Republic https://simons.berkeley.edu/talks/lower-bounds-techniques-proof-complexity-ii Lower Bounds in Computational Complexity Boot Camp
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