This is a preview of subscription content, log in via an institution to check access.
Literature Cited
S. V. Yablonskii, Functional Construction in k-Valued Logic [in Russian], Transactions of the Steklov Mathematics Institute, Vol. 51, Moscow (1958), pp. 5–142.
V. V. Glagolev, “Estimates of the complexity of the abridged disjunctive normal form for almost all logic-algebra functions,” Dokl. Akad. Nauk SSSR,158 No. 4, (1964).
V. V. Glagolev, “Upper complexity bound of the minimal disjunctive normal form for almost all logicalgebra functions,” in: Discrete Analysis, No. 5, [in Russian], Novosibirsk (1965).
A. D. Korshunov, “comparison of the complexity of the longest and shortest disjunctive normal forms and the lower bound of the number of dummy disjunctive normal forms for almost all Boolean functions,” Kibernetika, No. 4 (1968).
A. A. Sapozhenko, “On the longest length of a dummy disjunctive normal form for almost all Boolean functions,” Matematicheskie Zametki,4 No. 6 (1968).
Additional information
Translated from Kibernetika, No. 6, pp. 1–8, November–December, 1969.
Rights and permissions
About this article
Cite this article
Korshunov, A.D. The upper complexity bound of the shortest disjunctive normal forms of almost all Boolean functions. Cybern Syst Anal 5, 705–715 (1969). https://doi.org/10.1007/BF01094061
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01094061