Jay Belanger. Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions. Electronic Colloquium on Computational Complexity (ECCC), 2(18), 1995. [doi]
@article{ECCC-TR95-018,
title = {Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions},
author = {Jay Belanger},
year = {1995},
url = {http://eccc.hpi-web.de/eccc-reports/1995/TR95-018/index.html},
researchr = {https://researchr.org/publication/ECCC-TR95-018},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {2},
number = {18},
}