Lower Bound Proof for the Size of BDDs representing a Shifted Addition.

Jan Kleinekathöfer Alireza Mahzoon Rolf Drechsler

Published in: CoRR (2022)

Keyphrases

lower bound
upper bound
running times
worst case
heuristic search
branch and bound
branch and bound algorithm
objective function
lower and upper bounds
data sets
optimal solution
computational complexity
association rules
small size