Login / Signup
A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication.
Beate Bollig
Published in:
LATIN (2010)
Keyphrases
</>
lower bound
worst case
upper bound
optimal solution
objective function
computational complexity
np hard
model checking
significant bit