Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions

Jay Belanger. Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions. Electronic Colloquium on Computational Complexity (ECCC), 2(18), 1995. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: