A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions
Wolfgang J. PaulPublished in: STOC (1975)
Keyphrases
- boolean functions
- lower bound
- worst case
- uniform distribution
- upper bound
- polynomial size
- threshold functions
- objective function
- relevant variables
- np hard
- prime implicants
- functional properties
- membership queries
- dnf formulae
- bounded treewidth
- multi valued
- read once formulas
- branch and bound
- statistical queries
- linear threshold
- lower and upper bounds
- branch and bound algorithm
- optimal solution
- upper and lower bounds