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.

中文翻译：

---

关于可加复杂性测度布尔函数的最小化

最小化用于几何解释的可加复杂性度量的布尔函数的问题（因为通过面覆盖了单位立方体中的顶点的子集）是组合的最小覆盖范围加权问题的一种特殊组合说明。它的特异性由覆盖子集的族，包含在函数的单位顶点集合中的单位立方体的面，以及由确定面权重的面的复杂性度量确定在计算覆盖物的复杂度时。要测量复杂度，我们需要非负性，包含面的单调性和同构面的相等性。对于加性复杂度度量，