A Lower Bound on Branching Programs Reading Some Bits Twice.
Petr SavickýStanislav ZákPublished in: Theor. Comput. Sci. (1997)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- np hard
- branch and bound
- upper and lower bounds
- lower and upper bounds
- optimal solution
- worst case
- objective function
- lower bounding
- linear programming relaxation
- theoretical analysis
- lagrangian relaxation
- error correcting codes
- note taking
- sample complexity
- special case
- sufficiently accurate