This article is cited in 2 scientific papers (total in 2 papers)
On the problem of minimizing a single set of Boolean functions
I. P. Chukhrov
Institute of Computer Aided Design RAS, 19/18 2-nd Brestskaya St., 123056 Moscow, Russia
We study the set of Boolean functions that consist of a single connected component, have minimal complexes of faces which are not shortest and do not satisfy the sufficient condition for minimality based on the notion of an independent set of vertices. The independent minimization for the connected components and feasibility of sufficient conditions for the minimality can not be applied to minimizing of such functions. For this set of functions, we obtain lower bounds on the power and maximal number of complexes of faces which are minimal with respect to additive measures of linear and polynomial complexity. Ill. 1, bibliogr. 8.
Boolean function, unit cube, face, complex of faces, additive complexity measure, shortest complex of faces, minimal complex of faces.
PDF file (495 kB)
Journal of Applied and Industrial Mathematics, 2015, 9:3, 335–350
I. P. Chukhrov, “On the problem of minimizing a single set of Boolean functions”, Diskretn. Anal. Issled. Oper., 22:3 (2015), 75–97; J. Appl. Industr. Math., 9:3 (2015), 335–350
Citation in format AMSBIB
\paper On the problem of minimizing a~single set of Boolean functions
\jour Diskretn. Anal. Issled. Oper.
\jour J. Appl. Industr. Math.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
I. P. Chukhrov, “Proof of covering minimality by generalizing the notion of independence”, J. Appl. Industr. Math., 11:2 (2017), 193–203
I. P. Chukhrov, “On the minimization of Boolean functions for additive complexity measures”, J. Appl. Industr. Math., 13:3 (2019), 418–435
|Number of views:|