Counting problems are a type of computational problem in complexity and computability theory. The corresponding decision problem (#R) is defined to make it possible to reduce the search problem (cR) to it using a binary search. #R is not the graph of cR.

The course addresses both classic and recent developments in counting and sampling. It covers counting complexity, exact counting via determinants, sampling via Markov chains, and high-dimensional expanders.