弱长度归纳与慢增长深度布尔电路
Weak length induction and slow growing depth boolean circuits
摘要:
我们定义了一个电路复杂性类LD^i的层次,其深度是Ackermann层次中函数的逆。然后,我们引入了长度归纳法的极弱形式,并构造了一个有界算术理论L^i_2,它的可证全函数恰好对应于LD^i电路可计算的函数。最后,我们证明了L^i_2与一个对应于类AC^0的较弱理论AC^0CA之间的一个非守恒性结果。我们的证明利用KPT见证定理。
英文摘要:
We define a hierarchy of circuit complexity classes LD^i, whose depth are the inverse of a function in Ackermann hierarchy. Then we introduce extremely weak versions of length induction and construct a bounded arithmetic theory L^i_2 whose provably total functions exactly correspond to functions computable by LD^i circuits. Finally, we prove a non-conservation result between L^i_2 and a weaker theory AC^0CA which corresponds to the class AC^0. Our proof utilizes KPT witnessing theorem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。