Approximate Counting II
292 views · Published 1 February 2016 · 55:50 · Indexed 25 September 2026
Channel: Simons Institute for the Theory of Computing · 2016 · Education
Davin Richerby, University of Oxford Counting Complexity and Phase Transitions Boot Camp https://simons.berkeley.edu/talks/david-richerby-2016-01-26
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
-
45:30
Informational Substitutes and Complements for Prediction
-
23:27
Which Regular Expression Patterns are Hard to Match?
-
1:03:10
Decay of Correlations in Spin Systems
-
1:07:30
The Simple, Little and Slow Things Count: On Parameterized Counting Complexity