Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Beate BolligPublished in: Electron. Colloquium Comput. Complex. (2000)
Keyphrases
- lower bound
- max sat
- floating point
- upper bound
- integer arithmetic
- average case complexity
- branch and bound algorithm
- branch and bound
- objective function
- lower and upper bounds
- np hard
- reinforcement learning
- finite state
- optimal solution
- upper and lower bounds
- initial state
- finite automata
- sufficiently accurate
- worst case
- special case
- linear programming relaxation
- arithmetic operations
- matrix multiplication
- polynomial approximation
- dynamic programming