scispace - formally typeset
Search or ask a question

Showing papers by "Piotr Faliszewski published in 2004"

Journal Article•
Exponential time reductions and sparse languages in NEXP

[...]

Piotr Faliszewski
01 Jan 2004-Electronic Colloquium on Computational Complexity
TL;DR: A many-one reduction which is allowed to work in exponential time but may only output polynomially many symbols is proposed, and it is shown that there are no NEXP-hard sparse languages under this reduction unless EXP = UEXP.
Abstract: In this paper we dene 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.