A 2.5 n-Lower Bound on the Combinational Complexity of Boolean Functions.
Wolfgang J. PaulPublished in: SIAM J. Comput. (1977)
Keyphrases
- boolean functions
- lower bound
- worst case
- uniform distribution
- upper bound
- polynomial size
- branch and bound
- relevant variables
- dnf formulae
- membership queries
- branch and bound algorithm
- threshold functions
- read once formulas
- prime implicants
- optimal solution
- lower and upper bounds
- dnf formulas
- functional properties
- concept class
- statistical queries
- objective function
- heuristic search
- computational complexity
- binary decision diagrams
- relational databases
- search space
- np hard