| Attributs | Valeurs |
|---|
| type
| |
| Is Part Of
| |
| Subject
| |
| Title
| - Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs
|
| Date
| |
| has manifestation of work
| |
| related by
| |
| Author
| |
| Abstract
| - We investigate well-structured graph-driven parity-FBDDs, which strictly generalize the two well-known models parity OBDDs and well-structured graph-driven FBDDs. The first main result is a characterization of the complexity of Boolean functions represented by well-structured graph-driven parity-FBDDs in terms of invariants of the function represented and the graph-ordering used. As a consequence, we derive a lower bound criterion and prove an exponential lower bound for certain linear code functions. The second main result of this paper is a polynomial time algorithm that minimizes the number of nodes in a graph-driven parity-FBDD.
|
| article type
| |
| publisher identifier
| |
| Date Copyrighted
| |
| Rights
| |
| Rights Holder
| |
| is part of this journal
| |
| is primary topic
of | |
