arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0706.4095math.GRcs.CC
收藏

分数阶可计算性的若干定量问题

Some Quantitative Aspects of Fractional Computability

Ilya Kapovich, Paul Schupp

摘要:

受群论中一般情况复杂性研究成果的启发,本文应用有效Baire范畴和有效测度理论的思想,研究了可由部分算法“分式计算”的函数的复杂性类.为此目的,它是至关重要的,以指定一个允许的有效密度,$δ$,部分算法的收敛。集合$\mathcal{FC}(δ)$由所有的全函数$ f: Σ^\ast \to \{0,1 \}$组成,其中$Σ$是具有$|Σ| \ge 2$的有限字母表,其“在密度$δ$下可分数计算“。空间$\mathcal{FC}(δ) $实际上属于第二类,而使用$δ$和相对于抽象Blum复杂性度量的任何可计算界$β$定义的任何分数复杂性类实际上是贫乏的。Kautz和Miltersen的一个显著结果表明,相对于算法随机预言机$A$,相对化类$\mathcal{NP}^A$在严格指数时间的相对化$\mathcal{E}^A$中不具有有效多项式测度零。我们定义类$\mathcal{UFP}^A$的所有语言是分数判定的多项式时间在“一个统一的速率”的算法与预言$A$。我们发现,这个类确实有有效的多项式措施零$\mathcal{E}^A$为每个Oracle $A$。因此,放宽多项式时间可判定性的要求,只对一小部分可能的输入保持不变,并不能补偿随机预言机的非确定性的力量。

英文摘要:

Motivated by results on generic-case complexity in group theory, we apply the ideas of effective Baire category and effective measure theory to study complexity classes of functions which are "fractionally computable" by a partial algorithm. For this purpose it is crucial to specify an allowable effective density, $δ$, of convergence for a partial algorithm. The set $\mathcal{FC}(δ)$ consists of all total functions $ f: Σ^\ast \to \{0,1 \}$ where $Σ$ is a finite alphabet with $|Σ| \ge 2$ which are "fractionally computable at density $δ$". The space $\mathcal{FC}(δ) $ is effectively of the second category while any fractional complexity class, defined using $δ$ and any computable bound $β$ with respect to an abstract Blum complexity measure, is effectively meager. A remarkable result of Kautz and Miltersen shows that relative to an algorithmically random oracle $A$, the relativized class $\mathcal{NP}^A$ does not have effective polynomial measure zero in $\mathcal{E}^A$, the relativization of strict exponential time. We define the class $\mathcal{UFP}^A$ of all languages which are fractionally decidable in polynomial time at ``a uniform rate'' by algorithms with an oracle for $A$. We show that this class does have effective polynomial measure zero in $\mathcal{E}^A$ for every oracle $A$. Thus relaxing the requirement of polynomial time decidability to hold only for a fraction of possible inputs does not compensate for the power of nondeterminism in the case of random oracles.

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

↑