@InProceedings{mandal_et_al:LIPIcs.FSTTCS.2014.445,
author = {Mandal, Debasis and Pavan, A. and Venugopalan, Rajeswari},
title = {{Separating Cook Completeness from Karp-Levin Completeness Under a Worst-Case Hardness Hypothesis}},
booktitle = {34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)},
pages = {445--456},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-77-4},
ISSN = {1868-8969},
year = {2014},
volume = {29},
editor = {Raman, Venkatesh and Suresh, S. P.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2014.445},
URN = {urn:nbn:de:0030-drops-48621},
doi = {10.4230/LIPIcs.FSTTCS.2014.445},
annote = {Keywords: Cook reduction, Karp reduction, NP-completeness, Turing completeness, many-one completeness}
}