Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes.
Martin DietzfelbingerMiroslaw KutylowskiRüdiger ReischukPublished in: SPAA (1990)
Keyphrases
- boolean functions
- linear threshold
- uniform distribution
- marginal probabilities
- threshold functions
- upper and lower bounds
- prime implicants
- upper bound
- relevant variables
- dnf formulae
- membership queries
- lower bound
- functional properties
- worst case
- bi decomposition
- binary decision diagrams
- multi valued
- read once formulas