No NP Problems Averaging Over Ranking of Distributions are Harder

Jay Belanger, Jie Wang. No NP Problems Averaging Over Ranking of Distributions are Harder. Theoretical Computer Science, 181(2):229-245, 1997. [doi]

Authors

Jay Belanger

This author has not been identified. Look up 'Jay Belanger' in Google

Jie Wang

This author has not been identified. Look up 'Jie Wang' in Google