Abstract:
For the monotone symmetric threshold Boolean functions fn2(˜x)=⋁1⩽i<j⩽nxixj,n=2,3,…, it is established that a minimal contact circuit implementing fn2(˜x) contains 3n−4 contacts.
This research was supported
by the Russian Foundation for Basic Research
under grant 18.01.00337
“Synthesis problems, complexity, and reliability issues
in the theory of control systems.”
This publication is cited in the following 2 articles:
N. P. Red'kin, “On the complexity of implementation of characteristic functions of the spheres by circuits of functional elements”, Moscow University Mathematics Bulletin, 77:3 (2022), 127–130
N. P. Red'kin, “Minimal Contact Circuits for a Sequence of Boolean Functions”, Math. Notes, 110:1 (2021), 156–158