Abstract
For the monotone symmetric threshold Boolean functions \( f^n_2(\widetilde x\mspace{2mu})=\bigvee_{1\le i<j\le n}x_ix_j,\qquad n=2,3,\dots, \) it is established that a minimal contact circuit implementing \(f^n_2(\widetilde x\mspace{2mu})\) contains \(3n-4\) contacts.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. E. Shannon, “The synthesis of two-terminal switching circuits,” Bell System Tech. J. 28 (1), 59–98 (1949).
O. B. Lupanov, “On a method of circuit synthesis,” Izv. Vyssh. Uchebn. Zaved. Radioiz. 1 (1), 120–140 (1958).
N. P. Red’kin, “A proof of the minimality of certain circuits of functional elements,” in Problemy Kibernet. (Nauka, Moscow, 1970), Vol. 23, pp. 83–101.
C. Cardot, “Quelques résultats sur l’application de l’algèbre de Boole, à la synthèse des circuits à relais Ann. Télécommun.,” 7 (2), 75–84 (1952).
R. G. Nigmatullin, Complexity of Boolean functions (Izd. Kazan. Gos. Un-ta, Kazan, 1983) [in Russian].
S. M. Vartanyan, “A new proof of minimality of the contact circuit realizing a linear function,” in Metody Diskretnogo Analiza v Izuchenii Realizatsii Logicheskikh Funktsii, Metody Diskretn. Anal. (Novosibirsk, Izd. IM SO AN SSSR, 1984), Vol. 41, pp. 27–34.
S. A. Lozhkin, “A method for obtaining lower bounds for the complexity of contact circuits and some minimal circuits for linear functions,” in Sbornik Trudov Seminara po Diskretnoy Matematike i Ee Prilozheniyam (Izd. Mrkh.-Matem. Fak-ta MGU, Moscow, 1997), pp. 113–115.
Yu. L. Vasil’ev, “Minimal contact schemes for Boolean functions of four variables,” Dokl. AN SSSR 127 (2), 242–245 (1959).
E. F. Moore “Minimal complete relay decoding networks,” IBM J. Res. Develop. 4 (5), 525–531 (1960).
R. E. Krichevskii, “Minimal circuit of closing contacts for a Boolean function of \(n\) arguments,” in Diskret. Analiz (Novosibirsk, Izd. IM SO AN SSSR, 1965), Vol. 5, pp. 89–92.
Z. E. Koroleva, “A proof of the minimality of contact circuits of a certain type,” in Diskret. Analiz (Novosibirsk, Izd. IM SO AN SSSR, 1969), Vol. 14, pp. 18–27.
N. A. Karpova, “Minimal circuits of make contacts for monotonic functions of five variables,” in Problemy Kibernetiki (Nauka, Moscow, 1973), Vol. 26, pp. 53–94.
O. B. Lupanov, “On the comparison of the complexity of the implementation of monotonic functions by contact circuits containing only make contacts, and arbitrary contact circuits,” Dokl. AN SSSR 144 (6), 1245–1248 (1962).
R. E. Krichevskii, “On the complexity of parallel-serial contact circuits that implement a sequence of Boolean functions,” in Problemy Kibernetiki (Nauka, Moscow, 1964), Vol. 12, pp. 45–55.
M. I. Grinchuk, “On monotone complexity of threshold functions,” in Metody Diskretn. Anal. v Teorii Grafov i Slozhnosti, Metody Diskretn. Anal. (Novosibirsk, Izd. IM SO AN SSSR, 1992), Vol. 52, pp. 41–48.
O. B. Lupanov, Asymptotic Complexity Estimates of Control Systems (Izd. Moskov. Univ., Moscow, 1984) [in Russian].
O. B. Lupanov, “The synthesis of contact circuits,” Dokl. Akad. Nauk SSSR 119 (1), 23–26 (1958).
N. P. Red’kin, Reliability and Diagnostics of Circuits (Izd. Moskov. Univ., Moscow, 1992) [in Russian].
Funding
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.”
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Red’kin, N.P. Minimal Contact Circuits for Symmetric Threshold Functions. Math Notes 108, 370–380 (2020). https://doi.org/10.1134/S0001434620090060
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0001434620090060