A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover–Delayer games
| Image |  |
|---|---|
| Description | article by Olaf Beyersdorff et al published November 2010 in Information Processing Letters |
| Author/s | |
| Publication date | November 2010 |
| Language | |
| Country of origin | |
| Wikipedia link | |
| Access work | |
| Copyright status | |
| Missing/wrong data? | Edit Wikidata item |