Jay Belanger, Jie Wang. No NP Problems Averaging Over Ranking of Distributions are Harder. Theoretical Computer Science, 181(2):229-245, 1997. [doi]
@article{BelangerW97,
title = {No NP Problems Averaging Over Ranking of Distributions are Harder},
author = {Jay Belanger and Jie Wang},
year = {1997},
doi = {10.1016/S0304-3975(96)00272-1},
url = {http://dx.doi.org/10.1016/S0304-3975(96)00272-1},
researchr = {https://researchr.org/publication/BelangerW97},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {181},
number = {2},
pages = {229-245},
}