文章基本信息
- 标题：A lower bound on the size of resolution proofs of the Ramsey theorem
- 本地全文：下载
- 作者：Pavel Pudlak
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2011
- 卷号：2011
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：
We prove an exponential lower bound on the lengths of resolution proofs of propositions expressing the finite Ramsey theorem for pairs.
- 关键词：Ramsey Theorem; Resolution
