4 citations · 7 across the 2 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2015★ 4 cited
Inversion Complexity of Functions of Multi-Valued Logic
Vadim V. Kochergin, Anna V. Mikhailovich
The minimum number of NOT gates in a logic circuit computing a Boolean function is called the inversion complexity of the function. In 1957, A. A. Markov determined the inversion c…
cs.DM2015★ 3 cited
Some Extensions of the Inversion Complexity of Boolean Functions
V. V. Kochergin, A. V. Mikhailovich
The minimum number of NOT gates in a Boolean circuit computing a Boolean function is called the inversion complexity of the function. In 1957, A. A. Markov determined the inversion…