This is a preview of subscription content, log in via an institution to check access.
References
S. B. Akers, “A truth table method for the synthesis of combinational logic,” IEEE Trans. on Electr. Computers, EC-10, 4, 1961.
F. Miyata, “An extension of the method of Cohn and Lindaman,” IEEE Trans. on Electr. Computers, EC-13, 5, 1964.
Y. Tohma, “Decompositions of logical functions using majority decision elements,” IEEE Trans. on Electr. Computers, EC-13, 6, 1964
D. Liss, “A test for unate truth functions,” IEEE Trans. on Electr. Computers, EC-12, 6, 1963.
D. Bochmann, Über Ableitungen in der Schaltalgebra und einen damit formulierbaren Entwicklungssatz, Wiss. Z. Techn. Univers.,14, No. 6, Dresden, 1965.
V. I. Varshavskii, Synthesis of Computing and Controlling Schemes of Majority Elements (Abstract of author's dissertation), Moscow, 1965.
V. I. Varshavskii, “Majority decompositions,” zhurn. Avtomatika i telemekhanika, vol. 26 no. 9, Moscow, 1965.
V. I. Varshavskii and L. Ya. Rozenblyum, “Minimization of pyramidal schemes of majority element,” Izvestiya AN SSSR, Seriya “Tekhnicheskaya kibernetika,” no. 3, Moscow, 1964.
V. I. Varshavskii and L. Ya. Rozenblyum, “Functional separability in majority logic,” Izvestiya AN SSSR, Seriya “Tekhnicheskaya kibernetika,” no. 4, Moscow, 1965.
L. Ya. Rozenblyum, “A method of synthesizing majority schemes,” Izvestiya VUZ. Priborostroenie, no. 5, Moscow, 1965.
Additional information
Kibernetika, Vol. 4, No. 1, pp. 8–13, 1968
Rights and permissions
About this article
Cite this article
Rozenblyum, L.Y. The minimization of schemes on a majority basis. Cybern Syst Anal 4, 7–11 (1968). https://doi.org/10.1007/BF01074747
Issue Date:
DOI: https://doi.org/10.1007/BF01074747