Polynomial size proofs of the propositional pigeonhole principle (Q3775553): 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 / OpenAlex ID | |||
| Property / OpenAlex ID: W1968584500 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hard examples for resolution / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The relative efficiency of propositional proof systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The intractability of resolution / rank | |||
Normal rank | |||
Latest revision as of 14:45, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial size proofs of the propositional pigeonhole principle |
scientific article |
Statements
Polynomial size proofs of the propositional pigeonhole principle (English)
0 references
1987
0 references
length of proof
0 references
polynomial size Frege proofs
0 references
propositional pigeonhole principle
0 references
exponential speedup over resolution
0 references
provability in theories of bounded arithmetic
0 references
