A nearly-4 log n depth lower bound for formulas with restriction on top.
Hao WuPublished in: CoRR (2024)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- worst case
- branch and bound
- lower and upper bounds
- objective function
- np hard
- depth information
- optimal solution
- lower bounding
- upper and lower bounds
- depth map
- linear programming relaxation
- competitive ratio
- vc dimension
- knapsack problem
- multi view
- special case
- average case
- lagrangian relaxation
- search algorithm