A quadratic lower bound for homogeneous algebraic branching programs.
Mrinal KumarPublished in: Comput. Complex. (2019)
Keyphrases
- lower bound
- objective function
- upper bound
- branch and bound algorithm
- np hard
- branch and bound
- optimal solution
- worst case
- lower bounding
- lower and upper bounds
- computational complexity
- upper and lower bounds
- linear programming relaxation
- polynomial approximation
- algebraic geometry
- pruning algorithms
- lagrangian relaxation
- vc dimension
- pairwise
- ensemble methods
- decision trees
- sufficiently accurate
- neural network