Benchmark circuit complexity validation using binary decision diagram characteristics
It has been shown that when Binary Decision Diagrams (BDDs) are formed from uniformly distributed random Boolean Functions (BFs), the average number of nodes in the BDDs is in a simple relation to the number of variables and terms in the BFs. In the present work, the node counts for BBDs formed from...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
2006
|
| Subjects: | |
| Online Access: | http://shdl.mmu.edu.my/2140/ |