A Lower Bound for Integer Multiplication with Read-Once Branching Programs.
Stephen PonzioPublished in: SIAM J. Comput. (1998)
Keyphrases
- lower bound
- floating point
- max sat
- integer arithmetic
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- optimal solution
- lower bounding
- upper and lower bounds
- lower and upper bounds
- worst case
- np hard
- linear programming relaxation
- arithmetic operations
- sufficiently accurate
- dnf formulas
- search algorithm
- vc dimension
- sample complexity
- linear programming
- lagrangian relaxation
- pruning algorithms