Complexity of Boolean Functions on PRAMs - Lower Bound Techniques.
Miroslaw KutylowskiPublished in: Data Structures and Efficient Algorithms (1992)
Keyphrases
- boolean functions
- lower bound
- worst case
- upper bound
- uniform distribution
- polynomial size
- threshold functions
- statistical queries
- prime implicants
- branch and bound
- multi valued
- dnf formulae
- functional properties
- dnf formulas
- computational complexity
- linear threshold
- relevant variables
- binary decision diagrams
- branch and bound algorithm
- np hard
- bounded treewidth
- membership queries
- upper and lower bounds
- lower and upper bounds
- np complete
- bi decomposition
- read once formulas
- objective function
- truth table