On the argument complexity of multiply transitive Boolean functions.
Ulrich HedtstückPublished in: Logic and Machines (1983)
Keyphrases
- boolean functions
- uniform distribution
- relevant variables
- functional properties
- polynomial size
- threshold functions
- prime implicants
- binary decision diagrams
- dnf formulae
- multi class
- bounded treewidth
- disjunctive normal form
- read once formulas
- computational complexity
- linear threshold
- multi valued
- worst case
- bi decomposition