Login / Signup
Using lower bounds during dynamic BDD minimization.
Rolf Drechsler
Wolfgang Günther
Fabio Somenzi
Published in:
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2001)
Keyphrases
</>
lower bound
objective function
upper bound
special case
dynamic environments
neural network
branch and bound
database
data sets
machine learning
computational complexity
linear programming
branch and bound algorithm
max sat