Counting Complexity and Phase Transitions Boot Camp

# click the upper-left icon to select videos from the playlist

source: Simons Institute    2016年2月1日
Counting Complexity and Phase Transitions Boot Camp
Jan. 25 – Jan. 28, 2016
The Boot Camp is intended to acquaint program participants with the key themes of the program. All talks will be recorded.
The Classification Program for Counting Problems
Jin-Yi Cai (University of Wisconsin) and Heng Guo (Queen Mary, University of London)
Approximate Counting
Leslie Ann Goldberg (University of Oxford) and David Richerby (University of Oxford)
Markov Chain Mixing Times, Applications and Developments
Ivona Bezakova (Rochester Institute of Technology) and Nayantara Bhatnagar (University of Delaware)
Where the Hard Things Are
Andrea Montanari (Stanford University)
Dichotomy Theorems for Counting Problems
Xi Chen (Columbia University)
The Partition Function, Sampling and Equilibration in Physics
Florent Krzakala (ENS Paris) and Lenka Zdeborova (CEA-SACLAY)
Constraints, Gadgets, and Invariants
Andrei Bulatov (Simon Fraser University)
Random Constraint Satisfaction Problems
Nike Sun (UC Berkeley)
Decay of Correlations in Spin Systems
Yitong Yin (Nanjing University)
The Simple, Little and Slow Things Count: On Parameterized Counting Complexity
Radu Curticapean (Saarland University)
For more information, please visit https://simons.berkeley.edu/workshops/counting2016-boot-camp.
These presentations were supported in part by an award from the Simons Foundation.

The Classification Program for Counting Problems I 1:00:14 Jin-Yi Cai, University of Wisconsin-Madison https://simons.berkeley.edu/talks/jin...
Approximate Counting I 1:01:43
Markov Chain Mixing Times and Applications I 1:01:56
Where the Hard Things Are 1:06:54
Markov Chain Mixing Times and Applications II 1:02:17
Dichotomy Theorems for Counting Problems I 57:53
Approximate Counting II 55:50
The Partition Function, Sampling and Equilibration in Physics 1:10:35
Constraints, Gadgets, and Invariants 53:53
The Classification Program for Counting Problems II 1:02:31
Dichotomy Theorems for Counting Problems II 57:32
Markov Chain Mixing Times and Applications III 58:13
Random Constraint Satisfaction Problems 57:45
The Classification Program for Counting Problems III 54:57
Decay of Correlations in Spin Systems 1:03:10
The Simple, Little and Slow Things Count: On Parameterized Counting Complexity 1:07:30