A lower bound on the size of resolution proofs of the Ramsey theorem (Q436623): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2012.05.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993227745 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the weak pigeonhole principle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on propositional proof complexity of some Ramsey-type statements / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4281694 / rank | |||
Normal rank | |||
Latest revision as of 12:37, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on the size of resolution proofs of the Ramsey theorem |
scientific article |
Statements
A lower bound on the size of resolution proofs of the Ramsey theorem (English)
0 references
25 July 2012
0 references
computational complexity
0 references
Ramsey theorem
0 references
resolution proofs
0 references
