A quadratic lower bound for homogeneous algebraic branching programs.
Mrinal KumarPublished in: Electron. Colloquium Comput. Complex. (2017)
Keyphrases
- lower bound
- objective function
- upper bound
- branch and bound algorithm
- branch and bound
- np hard
- lower and upper bounds
- optimal solution
- upper and lower bounds
- lower bounding
- worst case
- higher order
- pairwise
- computational complexity
- polynomial approximation
- neural network
- linear programming relaxation
- competitive ratio
- scheduling problem
- vc dimension
- lagrangian relaxation
- constant factor
- sufficiently accurate