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