Determining the Multiplicative Complexity of Boolean Functions using SAT.
Mathias SoekenPublished in: CoRR (2020)
Keyphrases
- boolean functions
- uniform distribution
- randomly generated
- polynomial size
- threshold functions
- prime implicants
- membership queries
- multi valued
- relevant variables
- functional properties
- boolean formula
- truth table
- dnf formulae
- search algorithm
- binary decision diagrams
- disjunctive normal form
- bi decomposition
- satisfiability problem
- orders of magnitude
- linear threshold
- dnf formulas
- sat problem
- sat solvers