67 citations · 89 across the 8 of their papers we have counts for
1 paper · 1 filter
Mathias Soeken
We present a constructive SAT-based algorithm to determine the multiplicative complexity of a Boolean function, i.e., the smallest number of AND gates in any logic network that con…