arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.05956cs.CC
收藏

维数与复杂性类的结构

Dimension and the Structure of Complexity Classes

Jack H. Lutz, Neil Lutz, Elvira Mayordomo

摘要:

证明了关于复杂性类的维数结构的三个结果。1.点到集原理最近被用来证明分形几何中的几个新定理,它具有资源有限的实例。这些实例的特点的资源有界的维度的一组$X$的语言的相对化的资源有界的维度的各个元素的$X$,只要前者的资源界是足够大的参数化后者。因此,例如,EXP中的语言类$X$的维数是根据$X$的各个元素的相对化p维来表征的。2.每一个$\leq^P_m$ -可约化为p-选择集的语言都有p-维数0,这一事实相对于任意的神谕都成立。结合点到集原则的一个资源有限的实例,这意味着如果NP在EXP中有正维数,那么没有准多项式时间选择语言对NP来说是$\leq^P_m$ -困难的。3.如果NP语言的所有不交对的集合在EXP语言的所有不交对的集合中具有维数1,则NP在EXP中具有正维数。

英文摘要:

We prove three results on the dimension structure of complexity classes. 1. The Point-to-Set Principle, which has recently been used to prove several new theorems in fractal geometry, has resource-bounded instances. These instances characterize the resource-bounded dimension of a set $X$ of languages in terms of the relativized resource-bounded dimensions of the individual elements of $X$, provided that the former resource bound is large enough to parameterize the latter. Thus for example, the dimension of a class $X$ of languages in EXP is characterized in terms of the relativized p-dimensions of the individual elements of $X$. 2. Every language that is $\leq^P_m$-reducible to a p-selective set has p-dimension 0, and this fact holds relative to arbitrary oracles. Combined with a resource-bounded instance of the Point-to-Set Principle, this implies that if NP has positive dimension in EXP, then no quasipolynomial time selective language is $\leq^P_m$-hard for NP. 3. If the set of all disjoint pairs of NP languages has dimension 1 in the set of all disjoint pairs of EXP languages, then NP has positive dimension in EXP.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑