Addition is Exponentially Harder than Counting for Shallow Monotone Circuits
270 views · Published 1 October 2015 · 15:16 · Indexed 13 October 2026
Channel: Simons Institute for the Theory of Computing · 2015 · Education
Igor Oliveira, Columbia University Connections Between Algorithm Design and Complexity Theory https://simons.berkeley.edu/talks/igor-oliveira-2015-10-01
More from this channel
-
55:22
Thinking Algorithmically About Impossibility
-
27:28
The Query Complexity of Correlated Equilibria
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
37:51
On Maximizing Revenue for Multi-Item Auctions
-
32:46
How Well Do Prices Coordinate Markets
-
35:22
Computational Efficiency Requires Simple Taxation
-
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