2 search results - page 1 / 1 » Lower bounds for dynamic BDD reordering |
ASPDAC
2005
ACM
13 years 10 months ago
2005
ACM
— In this paper we present new lower bounds on BDD size. These lower bounds are derived from more general lower bounds that recently were given in the context of exact BDD minimi...
DAC
1999
ACM
13 years 9 months ago
1999
ACM
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...