New Lower Bounds Through an Improved Easy Witness Lemma
238 views · Published 13 September 2018 · 27:22 · Indexed 23 September 2026
Channel: Simons Institute for the Theory of Computing · 2018 · Education
Cody Murray (MIT) https://simons.berkeley.edu/talks/tbd-21 Boolean Devices
More from this channel
-
27:28
The Query Complexity of Correlated Equilibria
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
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
-
23:27
Which Regular Expression Patterns are Hard to Match?
-
1:03:10
Decay of Correlations in Spin Systems
-
21:50
Inferring Selective Advantage Relationships to Reconstruct Cancer Progression Models
-
38:09
Mechanisms of Amplification in Tumor Genomes