Lower Bounds for the Sum of Small-Size Algebraic Branching Programs.
C. S. BhargavPrateek DwivediNitin SaxenaPublished in: TAMC (2024)
Keyphrases
- small size
- lower bound
- objective function
- upper bound
- min sum
- np hard
- branch and bound
- branch and bound algorithm
- lower and upper bounds
- poor quality
- upper and lower bounds
- quadratic assignment problem
- linear programming
- pruning algorithms
- optimal solution
- weighted sum
- worst case
- linear programming relaxation
- randomly generated problems
- vc dimension
- lagrangian relaxation
- optimal cost