A lower bound for integer multiplication on randomized ordered read-once branching programs.
Farid M. AblayevMarek KarpinskiPublished in: Inf. Comput. (2003)
Keyphrases
- lower bound
- max sat
- floating point
- randomized algorithms
- upper bound
- integer arithmetic
- randomized algorithm
- branch and bound
- lower and upper bounds
- branch and bound algorithm
- objective function
- np hard
- upper and lower bounds
- optimal solution
- worst case
- lower bounding
- decision forest
- greedy algorithm
- linear programming relaxation
- real numbers
- matrix multiplication
- pruning algorithms
- read once formulas
- machine learning