Abstract
We give an asymptotic bound for the complexity of almost all functions for the method of cascades.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature cited
S. V. Yablonskii, “Functional constructions in k-valued logic,” Trudy Matem. In-ta Akad. Nauk SSSR,51, 5–142 (1958).
G. N. Povarov, “The mathematical theory of the synthesis of contact (1, k)-poles,” Dokl. Akad. Nauk SSSR,100, No. 5, 909–912 (1955).
V. N. Kuznetsov, “The realization of the functions of algebraic logic by the cascade method,” Kibernetika,1, 51–59, Kiev (1972).
S. V. Yablonskii, “Algorithmic difficulties in the synthesis of minimal contact schemes,” Problemy Kibernetiki, No. 2, 75–121, Moscow (1959).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 12, No. 6, pp. 769–780, December, 1972.
In conclusion the author wishes to express his deep gratitude to S. V. Yabionskii under whose direction this paper was written.
Rights and permissions
About this article
Cite this article
Denev, I.D. The complexity of the realization of almost all functions of the algebra of logic by the method of cascades. Mathematical Notes of the Academy of Sciences of the USSR 12, 897–903 (1972). https://doi.org/10.1007/BF01156053
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01156053