With quasi-linear queries, EXP is not polynomial time Turing reducible to sparse sets

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI:10.1109/SCT.1993.336528

B. Fu

引用次数: 19

Abstract

The lower bounds of queries required by the polynomial-time Turing reductions from exponential time classes to the sets of small density are investigated. Results for complexity classes E=DTIME(2/sup linear/) and EXP-DTIME(2/sup poly/) are shown.<>

查看原文本刊更多论文

对于拟线性查询，EXP不是多项式时间图灵可约到稀疏集的

研究了从指数时间类到小密度集的多项式时间图灵约简所需查询的下界。给出了复杂度类E=DTIME(2/sup linear/)和EXP-DTIME(2/sup poly/)的结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference

自引率

0.00%

发文量