Abstract
The problem of minimizing Boolean functions for additive complexity measures in a geometric interpretation, as covering a subset of vertices in the unit cube by faces, is a special type of a combinatorial statement of the weighted problem of a minimal covering of a set. Its specificity is determined by the family of covering subsets, the faces of the unit cube, that are contained in the set of the unit vertices of the function, as well as by the complexity measure of the faces, which determines the weight of the faces when calculating the complexity of the covering. To measure the complexity, we need nonnegativity, monotonicity in the inclusion of faces, and equality for isomorphic faces. For additive complexity measures, we introduce a classification in accordance with the order of the growth of the complexity of the faces depending on the dimension of the cube and study the characteristics of the complexity of the minimization of almost all Boolean functions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. V. Yablonskiĭ, Introduction to Discrete Mathematics (Vysshaya Shkola, Moscow, 2003) [in Russian].
I. P. Chukhrov, “On Complexity Measures of Complexes of Faces in the Unit Cube,” Diskretn. Anal. Issled. Open 20 (6), 77–94 (2013) [J. Appl. Indust. Math. 8, 9-19 (2014)].
Yu. F. Vasil’ev and V. V. Glagolev, “Metric Properties of Disjunctive Normal Forms,” Discrete Mathematics and Mathematical Problems of Cybernetics, V. 1 (Nauka, Moscow, 1974), 99–148.
A. A. Sapozhenko and I. P. Chukhrov, “Boolean Function Minimization in the Class of Disjunctive Normal Forms,” Itogi Nauki Tekh. Ser. Teor. Veroyatnost., Mat. Statist., Teor. Kibern. 25, 68–116 (1987) [J. Sov Math. 46, 2021-2052 (1989)].
N. Pippenger, “The Shortest Disjunctive Normal Form of a Random Boolean Function,” Random Structures & Algorithms 22, 161–186 (2003).
O. Coudert and T. Sasao, “Two-Fevel Fogic Minimization,” in Logic Synthesis and Verification (Kluwer Acad. Publ., Norwell, MA, 2002), pp. 1–27.
C. Umans, T. Villa, and A. F. Sangiovanni-Vincentelli, “Complexity of Two-Fevel Fogic Minimization,” IEEE Trans, on CAD of Integrated Circuits and Systems 25, 1230–1246 (2006).
K. Veber, “On Various Minimality Notions of the Disjunctive Normal Forms,” Problemy Kibernet. 36, 129–158 (1979).
I. P. Chukhrov, “On a Minimization Problem for a Set of Boolean Functions,” Diskretn. Anal. Issled. Open 22 (3), 75–97 (2015) [J. Appl. Indust. Math. 9, 335-350 (2015)].
I. P. Chukhrov, “On the Complexity of Minimizing Quasicyclic Boolean Functions,” Diskretn. Anal. Issled. Open 25 (3), 126–151, (2018) [J. Appl. Indust. Math. 12, 426-441 (2018)].
G. P. Gavrilov and A. A. Sapozhenko, Tasks and Exercises in Discrete Mathematics (Fizmatlit, Moscow, 2005) [in Russian].
Author information
Authors and Affiliations
Corresponding author
Additional information
Russian Text © The Author(s), 2019, published in Diskretnyi Analiz i Issledovanie Operatsii, 2019, Vol. 26, No. 3, pp. 115–140.
Rights and permissions
About this article
Cite this article
Chukhrov, I.P. On the Minimization of Boolean Functions for Additive Complexity Measures. J. Appl. Ind. Math. 13, 418–435 (2019). https://doi.org/10.1134/S1990478919030049
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478919030049