A Lower Bound for Read-Once-Only Branching Programs.
László BabaiPéter HajnalEndre SzemerédiGyörgy TuránPublished in: J. Comput. Syst. Sci. (1987)
Keyphrases
- lower bound
- max sat
- upper bound
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- np hard
- optimal solution
- objective function
- lower bounding
- worst case
- lagrangian relaxation
- read once formulas
- linear programming relaxation
- upper and lower bounds
- sufficiently accurate
- feasible solution
- linear programming
- supervised learning
- decision trees