Suppose we are given access to $ n $ independent samples from distribution $\mu $ and we
wish to output one of them with the goal of making the outputdistributed as close as possible …

We investigate the problem of computing the number of linear extensions of a given partial
order on n elements. The problem has applications in numerous areas, such as sorting …

The permanent of a matrix has numerous applications but is notoriously hard to compute.
While nonnegative matrices admit polynomial approximation schemes based on rapidly …

Counting integer solutions of linear constraints has found interesting applications in various
fields. It is equivalent to the problem of counting lattice points inside a polytope. However …

Monte Carlo integration is a key technique for designing randomized approximation
schemes for counting problems, with applications, eg, in machine learning and statistical …

The computation of the permanent of a matrix is a famous example of a problem that is# P-
hard (Valiant, 1979), implying that it is unlikely for a polynomial time algorithm for the …