缩放尺寸中的小跨距
Small Spans in Scaled Dimension
摘要:
Juedes和Lutz(1995)证明了指数时间内多项式时间多-一约化的小跨度定理。这个结果表明,对于语言A在指数时间内可判定,语言类可约化为A(下跨度)或问题类可约化为A(上跨度)在资源有限测度意义下是小的,特别是A的度是小的。小跨度定理已经被证明用于越来越强的多项式时间约简,并且多项式时间图灵约简的小跨度定理将意味着BPP!EXP.与资源有界测度的进展相反,Ambos-Spies,Merkle,Reimann,and Stephan(2001)证明了Lutz(2000)的资源有界维数不存在小跨度定理,即使对于多项式时间的多-一约简也是如此。最近由Hitchcock,Lutz和Mayordomo(2003)引入的资源限制缩放维度提供了资源限制维度的重新缩放。我们使用缩放维度来进一步理解关于多项式时间跨度和次数的度量和维度之间的对比。我们加强以前的结果表明,小跨度定理保持多项式时间的多-1减少在-3阶标度维数,但未能保持在-2阶标度维数。我们的结果在指数空间也成立。作为一个应用,我们证明了确定E的多-一完全语言的ESPACE中的-2阶或-1阶标度维数将给出P = BPP或P!= PSPACE。另一方面,无条件地证明了E的完全语言在ESPACE中具有-3阶标度维数0,在E中具有-2阶和-1阶标度维数1。
英文摘要:
Juedes and Lutz (1995) proved a small span theorem for polynomial-time many-one reductions in exponential time. This result says that for language A decidable in exponential time, either the class of languages reducible to A (the lower span) or the class of problems to which A can be reduced (the upper span) is small in the sense of resource-bounded measure and, in particular, that the degree of A is small. Small span theorems have been proven for increasingly stronger polynomial-time reductions, and a small span theorem for polynomial-time Turing reductions would imply BPP != EXP. In contrast to the progress in resource-bounded measure, Ambos-Spies, Merkle, Reimann, and Stephan (2001) showed that there is no small span theorem for the resource-bounded dimension of Lutz (2000), even for polynomial-time many-one reductions. Resource-bounded scaled dimension, recently introduced by Hitchcock, Lutz, and Mayordomo (2003), provides rescalings of resource-bounded dimension. We use scaled dimension to further understand the contrast between measure and dimension regarding polynomial-time spans and degrees. We strengthen prior results by showing that the small span theorem holds for polynomial-time many-one reductions in the -3rd-order scaled dimension, but fails to hold in the -2nd-order scaled dimension. Our results also hold in exponential space. As an application, we show that determining the -2nd- or -1st-order scaled dimension in ESPACE of the many-one complete languages for E would yield a proof of P = BPP or P != PSPACE. On the other hand, it is shown unconditionally that the complete languages for E have -3rd-order scaled dimension 0 in ESPACE and -2nd- and -1st-order scaled dimension 1 in E.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。