Geodesic
On the minimization of Boolean functions for~additive complexity measures
Diskretnyj analiz i issledovanie operacij, Tome 26 (2019) no. 3, pp. 115-140.

Voir la notice de l'article provenant de la source Math-Net.Ru

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. Bibliogr. 11.
Mots-clés : face of a Boolean cube, face complex, Boolean function, complexity measure, minimal face complex. 
@article{DA_2019_26_3_a5,
     author = {I. P. Chukhrov},
     title = {On the minimization of {Boolean} functions for~additive complexity measures},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {115--140},
     publisher = {mathdoc},
     volume = {26},
     number = {3},
     year = {2019},
     language = {ru},
     url = {https://geodesic-test.mathdoc.fr/item/DA_2019_26_3_a5/}
}
TY  - JOUR
AU  - I. P. Chukhrov
TI  - On the minimization of Boolean functions for~additive complexity measures
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2019
SP  - 115
EP  - 140
VL  - 26
IS  - 3
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/DA_2019_26_3_a5/
LA  - ru
ID  - DA_2019_26_3_a5
ER  - 
%0 Journal Article
%A I. P. Chukhrov
%T On the minimization of Boolean functions for~additive complexity measures
%J Diskretnyj analiz i issledovanie operacij
%D 2019
%P 115-140
%V 26
%N 3
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/DA_2019_26_3_a5/
%G ru
%F DA_2019_26_3_a5
I. P. Chukhrov. On the minimization of Boolean functions for~additive complexity measures. Diskretnyj analiz i issledovanie operacij, Tome 26 (2019) no. 3, pp. 115-140. https://geodesic-test.mathdoc.fr/item/DA_2019_26_3_a5/

[1] Yu. L. Vasil'ev, V. V. Glagolev, “Metric properties of disjunctive normal forms”, Discrete Mathematics and Mathematical Problems of Cybernetics, 1, Nauka, M., 1974, 99–148 (Russian)

[2] K. Veber, “On various minimality notions of the disjunctive normal forms”, Problemy Kibernet., 36 (1979), 129–158 (Russian) | MR | Zbl

[3] G. P. Gavrilov, A. A. Sapozhenko, Tasks and Exercises in Discrete Mathematics, Fizmatlit, M., 2005 (Russian)

[4] A. A. Sapozhenko, I. P. Chukhrov, “Boolean function minimization in the class of disjunctive normal forms”, J. Sov. Math., 46 (1989), 2021–2052 | DOI | MR | Zbl | Zbl

[5] I. P. Chukhrov, “On complexity measures of complexes of faces in the unit cube”, J. Appl. Indust. Math., 8 (2014), 9–19 | DOI | MR | Zbl

[6] I. P. Chukhrov, “On a minimization problem for a set of Boolean functions”, J. Appl. Indust. Math., 9 (2015), 335–350 | DOI | MR | Zbl

[7] I. P. Chukhrov, “On the complexity of minimizing quasicyclic Boolean functions”, J. Appl. Indust. Math., 12 (2018), 426–441 | DOI | MR | Zbl

[8] S. V. Yablonskii, Introduction to Discrete Mathematics, Vysshaya Shkola, M., 2003 (Russian)

[9] Coudert O., Sasao T., “Two-level logic minimization”, Logic synthesis and verification, Springer Int. Ser. Eng. Comp. Sci., 654, Kluwer Acad. Publ., Norwell, MA, 2001, 1–27

[10] Pippenger N., “The shortest disjunctive normal form of a random Boolean function”, Random Structures Algorithms, 22:2 (2003), 161–186 | DOI | MR | Zbl

[11] Umans C., Villa T., Sangiovanni-Vincentelli A. L., “Complexity of two-level logic minimization”, IEEE Trans. CAD Integr. Circuits Syst., 25:7 (2006), 1230–1246 | DOI