A 3n-Lower Bound on the Network Complexity of Boolean Functions.
Claus-Peter SchnorrPublished in: Theor. Comput. Sci. (1980)
Keyphrases
- boolean functions
- lower bound
- worst case
- uniform distribution
- upper bound
- threshold functions
- polynomial size
- optimal solution
- branch and bound algorithm
- branch and bound
- statistical queries
- complex networks
- prime implicants
- relevant variables
- functional properties
- binary decision diagrams
- objective function
- lower and upper bounds
- bounded treewidth
- linear threshold
- relational databases
- multi valued
- upper and lower bounds
- bi decomposition
- read once formulas
- multi class