A 5n - o(n) Lower Bound on the Circuit Size over U 2 of a Linear Boolean Function.
Alexander S. KulikovOlga MelanichIvan MihajlinPublished in: CiE (2012)
Keyphrases
- linear functions
- boolean functions
- upper bound
- lower bound
- polynomial size
- uniform distribution
- truth table
- relevant variables
- objective function
- branch and bound algorithm
- high speed
- lower and upper bounds
- branch and bound
- optimal solution
- bounded treewidth
- membership queries
- vc dimension
- np hard
- upper and lower bounds
- statistical queries
- digital circuits
- worst case
- sample size
- functional properties
- monotone boolean functions
- computational complexity
- pseudo boolean functions