@InProceedings{gu_et_al:LIPIcs.STACS.2010.2462,
author = {Gu, Xiaoyang and Hitchcock, John M. and Pavan, Aduri},
title = {{Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {429--440},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-16-3},
ISSN = {1868-8969},
year = {2010},
volume = {5},
editor = {Marion, Jean-Yves and Schwentick, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2462},
URN = {urn:nbn:de:0030-drops-24627},
doi = {10.4230/LIPIcs.STACS.2010.2462},
annote = {Keywords: Computational complexity, NP-completeness}
}