Larger lower bounds on the OBDD complexity of integer multiplication.

Published in: Inf. Comput. (2011)

Keyphrases

lower bound
worst case
floating point
upper bound
objective function
computational complexity
branch and bound
space complexity
np hard
boolean functions
integer arithmetic
memory requirements
upper and lower bounds
lower bounding
arithmetic operations
average case complexity