Lower Bounds to the Complexity of Symmetric Boolean Functions.
László BabaiPavel PudlákVojtech RödlEndre SzemerédiPublished in: Theor. Comput. Sci. (1990)
Keyphrases
- boolean functions
- lower bound
- worst case
- uniform distribution
- upper bound
- polynomial size
- relevant variables
- prime implicants
- objective function
- threshold functions
- dnf formulae
- branch and bound algorithm
- functional properties
- statistical queries
- truth table
- multi valued
- read once formulas
- branch and bound
- linear threshold
- linear functions
- disjunctive normal form
- decision problems
- np hard
- bounded treewidth
- upper and lower bounds
- lower and upper bounds
- multi class
- optimal solution