arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1307.4897cs.CC
收藏

小深度证明系统

Small Depth Proof Systems

Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah

摘要:

语言L的证明系统是函数f,使得Range(f)恰好是L。在本文中,我们期待证明系统从电路复杂性的角度来看,研究证明系统的计算非常有限。我们研究的限制是:它们可以通过具有恒定深度的有界扇入回路(NC ^0)或具有O(log log n)深度但具有O(1)交替的有界扇入回路(polylog AC ^0)来计算。每个输出位依赖于非常少的输入位;因此这样的证明系统对应于一种定理证明对上的局部纠错。我们准确地确定了证明系统捕获所有正则语言所需的能力。我们证明了所有的正则语言都有多对数AC^0证明系统,并且从之前的结果(Beyersdorff et al,MFCS 2011,其中首次引入了NC^0证明系统)来看,这是紧密的。我们的技术还表明,MAJ具有polylog AC^0证明系统。我们探讨了TAUT是否有NC^0证明系统的问题。解决这个关于2 TAUT的问题,由于2 TAUT与图中的可达性密切相关,我们对可达性提出了同样的问题。我们证明了无向可达性和有向不可达性都有NC^0证明系统,但有向可达性仍然是开放的。在NP语言的证明系统需要多大的能力的背景下,我们观察到相当一部分NP语言的证明系统不需要AC^0的全部能力;它们有SAC^0或coSAC^0证明系统。

英文摘要:

A proof system for a language L is a function f such that Range(f) is exactly L. In this paper, we look at proofsystems from a circuit complexity point of view and study proof systems that are computationally very restricted. The restriction we study is: they can be computed by bounded fanin circuits of constant depth (NC^0), or of O(log log n) depth but with O(1) alternations (polylog AC^0). Each output bit depends on very few input bits; thus such proof systems correspond to a kind of local error-correction on a theorem-proof pair. We identify exactly how much power we need for proof systems to capture all regular languages. We show that all regular language have polylog AC^0 proof systems, and from a previous result (Beyersdorff et al, MFCS 2011, where NC^0 proof systems were first introduced), this is tight. Our technique also shows that MAJ has polylog AC^0 proof system. We explore the question of whether TAUT has NC^0 proof systems. Addressing this question about 2TAUT, and since 2TAUT is closely related to reachability in graphs, we ask the same question about Reachability. We show that both Undirected Reachability and Directed UnReachability have NC^0 proof systems, but Directed Reachability is still open. In the context of how much power is needed for proof systems for languages in NP, we observe that proof systems for a good fraction of languages in NP do not need the full power of AC^0; they have SAC^0 or coSAC^0 proof systems.

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

↑