Dichotomy Theorems for Counting Problems

   Lecture 1: Dichotomy Theorems for Counting Problems I
   Lecture 2: Dichotomy Theorems for Counting Problems II


This series of talks is part of the Counting Complexity and Phase Transitions Boot Camp

Speaker: Xi Chen (Columbia University)

This mini-course will present a survey of dichotomy theorems for counting problems, which has been an active topic for fifteen years.  The first session will focus on dichotomy theorems for counting graph homomorphisms, and the second session will discuss dichotomy theorems for constraint satisfaction problems (CSPs).