An Exponential Lower Bound for One-Time-Only Branching Programs.
Stanislav ZákPublished in: MFCS (1984)
Keyphrases
- lower bound
- upper bound
- average case complexity
- branch and bound algorithm
- branch and bound
- objective function
- lower and upper bounds
- optimal solution
- lower bounding
- sufficiently accurate
- np hard
- upper and lower bounds
- worst case
- lagrangian relaxation
- active learning
- scheduling problem
- neural network
- sample complexity
- constant factor
- polynomial approximation
- machine learning