This is a preview of subscription content, log in via an institution to check access.
References
V. V. Glagolev, “Estimate of the complexity of the reduced disjunctive normal form for almost all functions of logical algebra,” DAN SSSR, 158, no. 4, Moscow, 1964.
Yu. G. Grigor'yan, “An arithmetic method for minimizing boolean functions,” Automata Theory Seminar [in Russian], Kiev, 1964.
Yu. I. Zhuravlev, “The separability of subsets of vertices of the n-dimensional unit cube,” Trudy Matematicheskogo instituta im. V. A. Steklova, 51,
Yu. I. Zhuravlev, “Set-theoretic methods in logical algebra,” collection: Problems of Cybernetics, no. 8, Moscow, 1962.
S. V. Yablonskii, “Algorithmic difficulties of minimum contact circuit synthesis,” Problems of Cybernetics [in Russian], no. 2, Moscow, 1959.
E. J. McClusky, Minimization of Boolean Functions, Bell. System. Tech., T. v. 35, n. 6, p. 1417–1444, 1956.
W. V. Quine, The Problem of Symplifying of Truth Functions, Amer. Math. Monthly, vol. 59, no. 8, p. 521–531, 1952.
Additional information
Kibernetika, Vol. 3, No. 1, pp. 26–30, 1967
Rights and permissions
About this article
Cite this article
Grigor'yan, Y.G. The variational problem of functions of logical algebra and a method for its computer realization. Cybern Syst Anal 3, 21–24 (1967). https://doi.org/10.1007/BF01072841
Issue Date:
DOI: https://doi.org/10.1007/BF01072841