A read-once lower bound and a (1, +k)-hierarchy for branching programs.
Petr SavickýStanislav ZákPublished in: Theor. Comput. Sci. (2000)
Keyphrases
- lower bound
- max sat
- upper bound
- branch and bound
- branch and bound algorithm
- optimal solution
- np hard
- lower and upper bounds
- objective function
- worst case
- competitive ratio
- hierarchical structure
- lower bounding
- upper and lower bounds
- sufficiently accurate
- vc dimension
- sample complexity
- lower level
- constant factor
- machine learning