@article{0cc79e3052f94994a079a2a4045124f4,
title = "On 1-truth-table-hard languages",
abstract = "The polynomial-time 1-tt-hard sets for EXP and RE are polynomial-time many-one-hard.",
author = "Steven Homer and Stuart Kurtz and James Royer",
note = "Funding Information: Corrrspor~rlr~~cr 10: S. Kurtz. Department of Computer Science, University of Chicago. II00 E 58th Street, Chicago, IL 60637, USA. *These results were presented by Steven Homer at the 5th Annual IEEE Structure Complexity Conference (cf. 171). **Supported in part by National Science Foundation grant CCR-8814339. ***Supported in part by National Science Foundation grant CCR-89011154.",
year = "1993",
month = jul,
day = "19",
doi = "10.1016/0304-3975(93)90126-E",
language = "English (US)",
volume = "115",
pages = "383--389",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "2",
}