Abstract
It is proved that the linear function gn(x1,..., xn) = x1 + ... + xnmod 2 is realized in the class of II-circuits with complexity Lπ(gn) ≥n2. Combination of this result with S. V. Yablonskii's upper bound yields Lπ(gn)\(\begin{array}{*{20}c} \smile \\ \frown \\ \end{array}\) n2.
Similar content being viewed by others
Literature cited
C. E. Shannon, “A symbolic analysis of relay and switching circuits,” Trans. AIEE,57, 713–722 (1938).
S. V. Yablonskii, “Realizations of a linear function in the class of II-circuits,” Dokl. Akad. Nauk SSSR,94, No. 5, 805–806 (1954).
B. A. Subbotovskaya, “Realization of linear functions by formulas in the basis V, &, and −,” Dokl. Akad. Nauk SSSR,136, No. 3, 553–555 (1961).
O. B. Lupanov, Synthesis of Some Classes of Control Systems [in Russian], in: Problems of Cybernetics, No. 10, Moscow (1963), pp. 63–97.
S. V. Yablonskii, “Functional Construction in k-valued logic,” Trudy Matem. In-ta, Akad. Nauk SSSR,51, 5–142 (1958).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 9, No. 1, pp. 35–40, January, 1971.
Rights and permissions
About this article
Cite this article
Khrapchenko, V.M. Complexity of the realization of a linear function in the class of II-circuits. Mathematical Notes of the Academy of Sciences of the USSR 9, 21–23 (1971). https://doi.org/10.1007/BF01405045
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01405045