Jay Belanger, Jie Wang. Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions. In Ding-Zhu Du, Ming Li, editors, Computing and Combinatorics, First Annual International Conference, COCOON 95, Xi an, China, August 24-26, 1995, Proceedings. Volume 959 of Lecture Notes in Computer Science, pages 410-419, Springer, 1995.
@inproceedings{BelangerW95,
title = {Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions},
author = {Jay Belanger and Jie Wang},
year = {1995},
researchr = {https://researchr.org/publication/BelangerW95},
cites = {0},
citedby = {0},
pages = {410-419},
booktitle = {Computing and Combinatorics, First Annual International Conference, COCOON 95, Xi an, China, August 24-26, 1995, Proceedings},
editor = {Ding-Zhu Du and Ming Li},
volume = {959},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-60216-X},
}