文章基本信息

标题：An Exponential Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle
本地全文：下载
作者：Jan Krajicek ; Pavel Pudlak ; Alan Woods 等
期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：1994
卷号：1994
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：
We prove lower bounds of the form expnd 0,">d0 on the length of proofs of an explicit sequence oftautologies, based on the Pigeonhole Principle, in proof systemsusing formulas of depth d for any constant d This is thelargest lower bound for the strongest proof system, for which anysuperpolynomial lower bounds are known.