Distributions that are p-time computable can be dominated (with respect to p-time computable functions) by uniform distributions, which is an important property for proving completeness results. Levin [Lev86] first proved this property using a ``perfect rounding" technique. Gurevich [Gur91] provided a different and easier proof, based on that Wang and Belanger [WB95] further showed that if the distribution is not too small, it will also dominate the same uniform distribution within a constant factor.
