Abstract
Computational counting problems involve computing weighted sums such as the value of an integral, the expectation of a random variable, or the partition function of a spin model. This mini-course is a survey on the complexity of approximately solving such counting problems. The talks will be accessible to people who have no background in counting complexity. This second session will focus particularly on the complexity of approximate counting within the domain of Constraint Satisfaction Problems.
The first session of this mini course will take place on Monday, January 25 from 11:00 am – 12:00 pm.