Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions.
Luís T. A. N. BrandãoÇagdas ÇalikMeltem Sönmez TuranRené PeraltaPublished in: IACR Cryptol. ePrint Arch. (2019)
Keyphrases
- boolean functions
- upper bound
- worst case
- polynomial size
- linear functions
- lower bound
- uniform distribution
- randomly generated
- dnf formulae
- relevant variables
- threshold functions
- lower and upper bounds
- membership queries
- upper and lower bounds
- functional properties
- prime implicants
- decision problems
- read once formulas
- computational complexity
- statistical queries
- bounded treewidth
- disjunctive normal form
- efficiently computable
- bi decomposition