Some Results on the Complexity of Boolean Functions for Table Look Up Architectures.
Rajeev MurgaiRobert K. BraytonAlberto L. Sangiovanni-VincentelliPublished in: ICCD (1993)
Keyphrases
- boolean functions
- polynomial size
- uniform distribution
- threshold functions
- functional properties
- prime implicants
- membership queries
- binary decision diagrams
- database
- relevant variables
- dnf formulae
- bounded treewidth
- bi decomposition
- linear threshold
- pseudo boolean functions
- read once formulas
- disjunctive normal form
- multi valued
- decision problems
- computational complexity
- machine learning