A lower bound on the size of resolution proofs of the Ramsey theorem
type: Item
instance of: scholarly article
title: A lower bound on the size of resolution proofs of the Ramsey theorem
zbMATH Open document ID: 1243.68187
author: Pavel Pudlák
published in: Information Processing Letters
publication date: 2012-07-25T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 03F20
zbMATH DE Number: 6059718
zbMATH Keywords: computational complexity
zbMATH Keywords: Ramsey theorem
zbMATH Keywords: resolution proofs
MaRDI profile type: Publication
full work available at URL: j.ipl.2012.05.004
OpenAlex ID: W1993227745
cites work: On the weak pigeonhole principle
cites work: A note on propositional proof complexity of some Ramsey-type statements
cites work: Q4281694
DOI: 10.1016/J.IPL.2012.05.004
description: scientific article; zbMATH DE number 6059718