A Quadratic Lower Bound for Algebraic Branching Programs.
Prerona ChatterjeeMrinal KumarAdrian SheBen Lee VolkPublished in: Computational Complexity Conference (2020)
Keyphrases
- lower bound
- objective function
- upper bound
- branch and bound algorithm
- optimal solution
- branch and bound
- lower and upper bounds
- np hard
- computational complexity
- upper and lower bounds
- pairwise
- worst case
- lower bounding
- lagrangian relaxation
- algebraic structure
- linear programming relaxation
- sufficiently accurate
- data sets
- linear algebra
- feasible solution