A tighter lower bound on the circuit size of the hardest Boolean functions.
Masaki YamamotoPublished in: Electron. Colloquium Comput. Complex. (2011)
Keyphrases
- boolean functions
- lower bound
- upper bound
- polynomial size
- uniform distribution
- branch and bound algorithm
- branch and bound
- linear functions
- threshold functions
- prime implicants
- truth table
- optimal solution
- upper and lower bounds
- relevant variables
- dnf formulae
- functional properties
- statistical queries
- lower and upper bounds
- high speed
- worst case
- objective function
- random instances
- linear threshold
- membership queries
- np hard
- decision trees
- bounded treewidth
- sample complexity
- computational complexity
- linear programming relaxation
- dnf formulas
- multi class
- search algorithm