Bounded-depth Frege lower bounds for weaker pigeonhole principles
Josh Buresh-OppenheimPaul BeameToniann PitassiRan RazAshish SabharwalPublished in: Electron. Colloquium Comput. Complex. (2002)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- np hard
- depth information
- objective function
- depth map
- machine learning
- lower bounding
- theoretical framework
- lower and upper bounds
- optimal cost
- quadratic assignment problem
- linear programming relaxation
- upper and lower bounds
- worst case
- special case
- search algorithm
- data structure
- similarity measure