Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs.
Henrik BrosenneMatthias HomeisterStephan WaackPublished in: RAIRO Theor. Informatics Appl. (2002)
Keyphrases
- boolean functions
- bounded treewidth
- structured data
- polynomial size
- uniform distribution
- threshold functions
- relevant variables
- worst case
- functional properties
- pseudo boolean functions
- prime implicants
- membership queries
- graph structure
- directed graph
- multi valued
- xml documents
- computational complexity
- dnf formulae
- machine learning
- linear threshold
- directed acyclic graph
- disjunctive normal form
- bi decomposition
- truth table