Loading...
Please wait, while we are loading the content...
Similar Documents
Bounds on Size of Decision Diagrams (1997)
| Content Provider | CiteSeerX |
|---|---|
| Author | Dvorak, Vaclav |
| Abstract | Abstract: Known upper bounds on the number of required nodes (size) in the ordered binary and multiple-valued decision diagram (DD) for representation of logic functions are reviewed and reduced by a small constant factor. New upper bounds are derived for partial logic functions containing don't cares and also for complete Boolean functions specified by Boolean expressions. The evaluation of upper bounds is based on a bottom-up algorithm for constructing efficient ordered DDs developed by the author. |
| File Format | |
| Volume Number | 3 |
| Journal | JUCS - The Journal of Universal Computer Science (JUCS |
| Language | English |
| Publisher Date | 1997-01-01 |
| Access Restriction | Open |
| Subject Keyword | Decision Diagram Upper Bound Complete Boolean Function Logic Function Multiple-valued Decision Diagram Bottom-up Algorithm Boolean Expression Required Node Small Constant Factor New Upper Bound Partial Logic Function |
| Content Type | Text |
| Resource Type | Article |
