小复杂类上的Baire范畴与Meager-Comager定律
Baire Categories on Small Complexity Classes and Meager-Comeager Laws
摘要:
我们引入两个资源有界的Baire类概念,小的复杂性类,如P,SUBEXP,PSPACE和概率类,如BPP,不同的是如何计算相应的有限扩展策略。我们通过资源有界的巴拿赫-马祖尔游戏的小集合的另一种表征。作为第一个概念的应用,我们证明了对于几乎所有的语言A(即除了一个微薄的类)在次指数时间内可计算,P(A)=BPP(A)。我们还表明,几乎所有的语言在PSPACE不具有小的非均匀复杂性。然后,我们切换到第二Baire类别的概念(称为本地可计算),并表明,类SPARSE是微薄的P.我们表明,在对比资源有界的措施的情况下,微薄的comeager法律可以获得许多标准的复杂性类,相对于本地可计算的Baire类别BPP和PSPACE。另一个局部可计算Baire范畴与资源受限测度不同的主题是关于弱完备性:基于局部可计算的Baire范畴,我们证明了P中不存在弱完备性概念,即P的每个P-弱完备集都是P的完备集.我们还证明了,如果P不等于DSPACE(log n),这同样适用于准多时间。最后,我们观察到,本地可计算的Baire类别是不可比拟的,与所有现有的资源有限的措施概念上的小复杂类,这可能解释为什么这两个设置似乎从根本上不同。
英文摘要:
We introduce two resource-bounded Baire category notions on small complexity classes such as P, SUBEXP, and PSPACE and on probabilistic classes such as BPP, which differ on how the corresponding finite extension strategies are computed. We give an alternative characterization of small sets via resource-bounded Banach-Mazur games. As an application of the first notion, we show that for almost every language A (i.e. all except a meager class) computable in subexponential time, P(A)=BPP(A). We also show that almost all languages in PSPACE do not have small nonuniform complexity. We then switch to the second Baire category notion (called locally-computable), and show that the class SPARSE is meager in P. We show that in contrast to the resource-bounded measure case, meager-comeager laws can be obtained for many standard complexity classes, relative to locally-computable Baire category on BPP and PSPACE. Another topic where locally-computable Baire categories differ from resource-bounded measure is regarding weak-completeness: we show that there is no weak-completeness notion in P based on locally-computable Baire categories, i.e. every P-weakly-complete set is complete for P. We also prove that the class of complete sets for P under Turing-logspace reductions is meager in P, if P is not equal to DSPACE(log n), and that the same holds unconditionally for quasi-poly time. Finally we observe that locally-computable Baire categories are incomparable with all existing resource-bounded measure notions on small complexity classes, which might explain why those two settings seem to differ so fundamentally.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。