New Bounds on the Multiplicative Complexity of Boolean Functions.
Meltem Sönmez TuranPublished in: IACR Cryptol. ePrint Arch. (2022)
Keyphrases
- boolean functions
- linear threshold
- uniform distribution
- polynomial size
- worst case
- threshold functions
- upper bound
- linear functions
- membership queries
- prime implicants
- binary decision diagrams
- relevant variables
- bounded treewidth
- dnf formulae
- bi decomposition
- functional properties
- computational complexity
- multi valued
- lower bound
- upper and lower bounds
- read once formulas