Lower bounds for the complexity of restrictions of Boolean functions.
A. V. ChashkinPublished in: Discret. Appl. Math. (2001)
Keyphrases
- boolean functions
- lower bound
- uniform distribution
- worst case
- polynomial size
- upper bound
- threshold functions
- prime implicants
- dnf formulae
- functional properties
- branch and bound
- branch and bound algorithm
- read once formulas
- disjunctive normal form
- multi valued
- lower and upper bounds
- binary decision diagrams
- membership queries
- upper and lower bounds
- optimal solution
- objective function
- vc dimension
- heuristic search
- np hard