The complexity of modular decomposition of Boolean functions.
Jan C. BiochPublished in: Discret. Appl. Math. (2005)
Keyphrases
- boolean functions
- bi decomposition
- functional decomposition
- polynomial size
- uniform distribution
- threshold functions
- prime implicants
- pseudo boolean functions
- membership queries
- dnf formulae
- computational complexity
- functional properties
- relevant variables
- dnf formulas
- bounded treewidth
- multi valued
- binary decision diagrams
- statistical queries
- temporal logic