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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.