A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games (Q1675824)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games |
scientific article; zbMATH DE number 6802678
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games |
scientific article; zbMATH DE number 6802678 |
Statements
A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games (English)
0 references
3 November 2017
0 references
computational complexity
0 references
proof complexity
0 references
prover-delayer games
0 references
resolution
0 references
0 references
