Relative Content

Tag Archive for combinatorics

Sampling from a Superexponential Population in Polynomial Time

I’d like to sample from a well-defined population of superexponential size with uniform probability among the population. For example, say the population is the set of unique permutations of combinations without replacement of the integers {0, 1, ..., n-1}, where the sequence length is AT MOST n.