This article is cited 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

Abstract: 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.

Keywords: Boolean function, unit cube, face, complex of faces, additive complexity measure, shortest complex of faces, minimal complex of faces.

UDC: 519.714.7

Received: 16.01.2015

DOI: 10.17377/daio.2015.22.471

 English version: Journal of Applied and Industrial Mathematics, 2015, 9:3, 335–350

Bibliographic databases:

• 
•