Abstract
The paper deals with the problem of counting and minimizing the number of paths
in Binary Decision Diagrams. The suggested approach uses the linear transform of initial
variables and is based on a newly introduced weighted autocorrelation function. It is shown
that the total number of paths in BDD is the sum of values of a weighted autocorrelation
function. The efficiency of the proposed technique is illustrated on a number of benchmarks.
| Original language | American English |
|---|---|
| Title of host publication | The 7th International Workshop on Boolean Problems |
| State | Published - 2006 |