Implementation complexity of Boolean functions with a small number of ones
Abstract We consider the class F n, k consisting of n-ary Boolean functions that take the value one on exactly k input tuples. For small values of k the class F n, k is splitted into subclasses, and for every subclass we find the asymptotics of the Shannon function of circuit implementation in the basis { x & y , x ‾ } $ \{x\&y,\overline x\} $ (or in the basis { x ∨ y , x ‾ } ) $ \{x\vee y,\overline x\}) $ ; the weights of the basic gates are arbitrary strictly positive numbers.
2018 ◽
Vol 28
(5)
◽
pp. 309-318
◽
Keyword(s):
2019 ◽
Vol 29
(4)
◽
pp. 241-254
◽
1991 ◽
Vol 138
(1)
◽
pp. 48
◽
2018 ◽
Vol 26
(3)
◽
pp. 115-140
Keyword(s):
2020 ◽
Vol E103.A
(12)
◽
pp. 1659-1665
2011 ◽
Vol E94-A
(6)
◽
pp. 1434-1440
◽
2013 ◽
Vol E96.A
(7)
◽
pp. 1653-1656
◽
2012 ◽
Vol E95.A
(6)
◽
pp. 1056-1064
◽