Upper bounds on the multiplicative complexity of symmetric Boolean functions.
Luís T. A. N. BrandãoÇagdas ÇalikMeltem Sönmez TuranRené PeraltaPublished in: Cryptogr. Commun. (2019)
Keyphrases
- boolean functions
- upper bound
- worst case
- lower bound
- uniform distribution
- randomly generated
- polynomial size
- relevant variables
- upper and lower bounds
- threshold functions
- linear functions
- dnf formulae
- functional properties
- prime implicants
- multi valued
- binary decision diagrams
- bi decomposition
- lower and upper bounds
- objective function
- read once formulas
- truth table
- efficiently computable
- membership queries
- vc dimension
- sample complexity
- sample size
- theoretical analysis