Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Mikhailovich, Anna V."'
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 complexity of every Boolean function and proved that $\lceil\log_{2}(d(
Externí odkaz:
http://arxiv.org/abs/1510.05942
Publikováno v:
Discrete Mathematics & Applications; Oct2017, Vol. 27 Issue 5, p295-302, 8p
