A lower bound for integer multiplication with read-once branching programs.
Stephen PonzioPublished in: STOC (1995)
Keyphrases
- lower bound
- max sat
- floating point
- upper bound
- integer arithmetic
- branch and bound algorithm
- branch and bound
- np hard
- lower and upper bounds
- objective function
- lower bounding
- worst case
- upper and lower bounds
- optimal solution
- arithmetic operations
- sufficiently accurate
- polynomial approximation
- sample complexity
- read once formulas
- lagrangian relaxation
- online algorithms
- linear programming relaxation
- matrix multiplication
- decision trees
- vc dimension
- sample size