Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 -
1 of
1
Asymptotically Optimal Bounds For OBDDs And The Solution Of Some Basic OBDD Problems
, 2000
"... Ordered binary decision diagrams (OBDDs) are nowadays the most common dynamic data structure or representation type for Boolean functions. Among the many areas of application are verification, model checking, and computer aided design. For many functions it is easy to estimate the OBDD size but asym ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
but asymptotically optimal bounds are only known in simple situations. In this paper, methods for proving asymptotically optimal bounds are presented and applied to the solution of some basic problems concerning OBDDs. The largest size increase by a synthesis step of pi-OBDDs followed by an optimal reordering
