Skip to main content

Computational Counting Problems

Computational counting problems are concerned with computing sums, weighted sums and integrals including, for example, the expectation of a random variable or the probability of an event. We are interested in characterising the inherent difficulty of exact and approximate counting problems and in the development of relevant algorithmic techniques.


Past Members

Miriam Backens
Jacob Focke
John Lapinskas
David Richerby
Kuan Yang