代数证明复杂性:进展、前沿与挑战
Algebraic Proof Complexity: Progress, Frontiers and Challenges
摘要:
我们调查最近的进展证明复杂性强证明系统及其连接代数电路复杂性,显示两者之间的协同作用如何产生新的方法来解决基本的开放问题,解决老问题,和新的研究方向。特别是,我们专注于证明复杂性下界(即某些重言式的证明大小的下界),代数电路下界和多项式身份测试问题从去随机化理论之间的紧密联系。
英文摘要:
We survey recent progress in the proof complexity of strong proof systems and its connection to algebraic circuit complexity, showing how the synergy between the two gives rise to new approaches to fundamental open questions, solutions to old problems, and new directions of research. In particular, we focus on tight connections between proof complexity lower bounds (namely, lower bounds on the size of proofs of certain tautologies), algebraic circuit lower bounds, and the Polynomial Identity Testing problem from derandomization theory.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。