A New Lower Bound on the Expected Size of Irredundant Forms for Boolean Functions.
Luke O'ConnorPublished in: Inf. Process. Lett. (1995)
Keyphrases
- boolean functions
- lower bound
- polynomial size
- upper bound
- uniform distribution
- threshold functions
- statistical queries
- branch and bound algorithm
- bounded treewidth
- multi valued
- linear functions
- dnf formulae
- objective function
- relevant variables
- lower and upper bounds
- branch and bound
- np hard
- bi decomposition
- membership queries
- upper and lower bounds
- prime implicants
- computational complexity
- optimal solution
- binary decision diagrams
- functional properties
- disjunctive normal form