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

关于求难重言式的计算复杂性

On the computational complexity of finding hard tautologies

Jan Krajicek

摘要:

这是众所周知的(cf。K.- Pudlák 1989)证明了一个多项式时间算法很难找到命题证明系统$P$的重言式当且仅当$P$不是最优的.这样的算法采用$1^{(k)}$并输出大小至少为$k$的重言式$τ_k$,使得$P$在所有$τ_k$的集合上不是p有界的。我们考虑两个更一般的搜索问题,涉及到找到一个硬公式,{ \bf Cert}和{ \bf查找},动机是两个假设的情况下:一个可以证明,$\np \neq co\np$,并没有最佳的证明系统存在。在{ \bf Cert}中,要求找到一个证明,证明具有$k$输入的给定非确定性电路不定义$TAUT \cap \kk$。在{ \bf Find}中,给定$1^{(k)}$和大小最大为$k^{c_0}$的重言式$α$,应该输出大小为$k$的重言式$β$,其不具有来自$α$的替换实例的大小$k^{c_1}$ $P$证明。我们将证明,假设存在一个指数困难的单向置换,{ \bf Cert}不能解决的时间$2^{O(k)}$算法。使用一个更强的假设的证明复杂性的Nisan-Wigderson生成器,我们表明,这两个问题{ \bf Cert}和{ \bf查找}实际上只是部分定义为无限多个$k$(即有输入对应于$k$的问题没有解决方案)。结果是基于解释的Nisan-Wigderson发电机作为一个证明系统。

英文摘要:

It is well-known (cf. K.-Pudlák 1989) that a polynomial time algorithm finding tautologies hard for a propositional proof system $P$ exists iff $P$ is not optimal. Such an algorithm takes $1^{(k)}$ and outputs a tautology $τ_k$ of size at least $k$ such that $P$ is not p-bounded on the set of all $τ_k$'s. We consider two more general search problems involving finding a hard formula, {\bf Cert} and {\bf Find}, motivated by two hypothetical situations: that one can prove that $\np \neq co\np$ and that no optimal proof system exists. In {\bf Cert} one is asked to find a witness that a given non-deterministic circuit with $k$ inputs does not define $TAUT \cap \kk$. In {\bf Find}, given $1^{(k)}$ and a tautology $α$ of size at most $k^{c_0}$, one should output a size $k$ tautology $β$ that has no size $k^{c_1}$ $P$-proof from substitution instances of $α$. We shall prove, assuming the existence of an exponentially hard one-way permutation, that {\bf Cert} cannot be solved by a time $2^{O(k)}$ algorithm. Using a stronger hypothesis about the proof complexity of Nisan-Wigderson generator we show that both problems {\bf Cert} and {\bf Find} are actually only partially defined for infinitely many $k$ (i.e. there are inputs corresponding to $k$ for which the problem has no solution). The results are based on interpreting the Nisan-Wigderson generator as a proof system.

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

↑