A Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer Games.
Olaf BeyersdorffNicola GalesiMassimo LauriaPublished in: Electron. Colloquium Comput. Complex. (2010)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- tree structure
- objective function
- video games
- computer games
- tree structures
- lower and upper bounds
- worst case
- game design
- index structure
- np hard
- theorem prover
- game playing
- spanning tree
- linear programming relaxation
- binary tree
- lower bounding
- competitive ratio
- sufficiently accurate
- b tree
- low resolution
- high resolution
- optimal solution
- theorem proving
- game theoretic
- game theory
- online game
- tree search
- game tree
- digital games
- online learning
- imperfect information
- special case