Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication.
Beate BolligPublished in: RAIRO Theor. Informatics Appl. (2001)
Keyphrases
- lower bound
- max sat
- floating point
- upper bound
- integer arithmetic
- branch and bound
- average case complexity
- np hard
- branch and bound algorithm
- lower and upper bounds
- objective function
- finite state
- upper and lower bounds
- lower bounding
- sample complexity
- worst case
- arithmetic operations
- polynomial approximation
- optimal solution
- learning theory
- theoretical analysis
- read once formulas