A Non-linear Time Lower Bound for Boolean Branching Programs
Miklós AjtaiPublished in: Electron. Colloquium Comput. Complex. (1999)
Keyphrases
- lower bound
- worst case
- upper bound
- branch and bound algorithm
- boolean functions
- real valued
- np hard
- branch and bound
- lower and upper bounds
- objective function
- optimal solution
- lower bounding
- lagrangian relaxation
- upper and lower bounds
- vc dimension
- polynomial approximation
- sample size
- approximation algorithms
- active learning
- uniform distribution
- computational complexity
- boolean queries
- pruning algorithms