Two lower bounds for branching programs
Miklós AjtaiLászló BabaiPéter HajnalJános KomlósPavel PudlákVojtech RödlEndre SzemerédiGyörgy TuránPublished in: STOC (1986)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- worst case
- objective function
- lower bounding
- np hard
- vc dimension
- min sum
- lower and upper bounds
- optimal solution
- upper and lower bounds
- reduced error pruning
- max sat
- linear programming relaxation
- pruning algorithms
- sample complexity
- optimal cost
- machine learning
- online learning
- learning algorithm