Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Pavel Pudlák. A lower bound on the size of resolution proofs of the Ramsey theorem. Electronic Colloquium on Computational Complexity (ECCC), 18:162, 2011. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: A lower bound on the size of resolution proofs of the Ramsey theoremPavel Pudlák. ipl, 112(14-15):610-611, 2012. [doi]
The following publications are possibly variants of this publication: