1 research outputs found
Exponential Time Reductions and Sparse Languages in NEXP
In this paper we define a many-one reduction which is allowed to work in exponential time but may only output polynomially many symbols. We show that there are no NEXP-hard sparse languages under our reduction unless EXP = UEXP