No NP Problems Averaging Over Ranking of Distributions are Harder. Belanger, J. & Wang, J. Theor. Comput. Sci., 181(2):229-245, 1997.
No NP Problems Averaging Over Ranking of Distributions are Harder. [link]Link  No NP Problems Averaging Over Ranking of Distributions are Harder. [link]Paper  bibtex   
@article{journals/tcs/BelangerW97,
  author = {Belanger, Jay and Wang, Jie},
  date = {2003-11-19},
  ee = {http://dx.doi.org/10.1016/S0304-3975(96)00272-1},
  interhash = {e679726abe926203b55156752c08d4c3},
  intrahash = {018fad0599c84bd79c0c37d8967c97c2},
  journal = {Theor. Comput. Sci.},
  number = 2,
  pages = {229-245},
  title = {No NP Problems Averaging Over Ranking of Distributions are Harder.},
  url = {http://dblp.uni-trier.de/db/journals/tcs/tcs181.html#BelangerW97},
  volume = 181,
  year = 1997
}

Downloads: 0