A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games.
Olaf BeyersdorffNicola GalesiMassimo LauriaPublished in: Inf. Process. Lett. (2010)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- tree structure
- objective function
- worst case
- tree search
- np hard
- lower bounding
- high resolution
- optimal solution
- video games
- lower and upper bounds
- theorem proving
- theorem prover
- tree structures
- sufficiently accurate
- nash equilibrium
- game theory
- spanning tree
- game theoretic
- computer games
- low resolution
- educational games
- game play
- r tree
- decision trees