Document Type
Report
Date
12-15-1991
Keywords
Languages
Language
English
Disciplines
Computer Sciences
Description/Abstract
The polynomial time 1-tt complete sets for EXP and RE are polynomial time many-one complete.
Recommended Citation
Homer, Steven; Kurtz, Stuart A.; and Royer, James S., "A Note on Many-One and 1-Truth-Table Complete Languages" (1991). Electrical Engineering and Computer Science - Technical Reports. 135.
https://surface.syr.edu/eecs_techreports/135
Source
local
Additional Information
School of Computer and Information Science, Syracuse University, SU-CIS-91-41