Exponential time reductions and sparse languages in NEXP
本文档由 enbook 分享于2010-10-16 01:33
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.
分享：
君，已阅读到文档的结尾了呢~~