A Nonlinear Lower Bound for the Formula Complexity of Certain Boolean Functions.
Gerd WechsungPublished in: IFIP Congress (1977)
Keyphrases
- boolean functions
- lower bound
- prime implicants
- worst case
- uniform distribution
- polynomial size
- upper bound
- disjunctive normal form
- statistical queries
- lower and upper bounds
- prime implicates
- boolean formula
- relevant variables
- membership queries
- branch and bound algorithm
- functional properties
- threshold functions
- computational complexity
- conjunctive normal form
- dnf formulae
- multi valued
- abductive reasoning
- branch and bound
- optimal solution
- linear threshold
- dnf formulas
- objective function
- pac learning
- decision problems
- read once formulas
- np hard