ON 1-TRUTH-TABLE-HARD LANGUAGES

Authors
HOMER S KURTZ S ROYER J
Citation
S. Homer et al., ON 1-TRUTH-TABLE-HARD LANGUAGES, Theoretical computer science, 115(2), 1993, pp. 383-389
Citations number
15
Categorie Soggetti
Computer Sciences","Computer Applications & Cybernetics",Mathematics
Journal title
Theoretical computer science → ACNP
ISSN journal
03043975
Volume
115
Issue
2
Year of publication
1993
Pages
383 - 389
Database
ISI
SICI code
0304-3975(1993)115:2<383:O1L>2.0.ZU;2-K
Abstract
The polynomial-time 1-tt-hard sets for EXP and RE are polynomial-time many-one-hard