Volume 22, No 3, 2015, P. 75-97
UDC 519.714.7
**Chukhrov I. P. **
On the problem of minimizing a single set of Boolean functions
*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.
DOI: 10.17377/daio.2015.22.471
*Igor P. Chukhrov *^{1}
1. Institute of Computer Aided Design RAS,
19/18 2-nd Brestskaya St., 123056 Moscow, Russia
e-mail: chip@icad.org.ru
Received 16 January 2015
# References
[1] Yu. L. Vasil’ev, Massive classes of dense Boolean functions, in Metody diskretnogo analiza v sinteze upravlyayushchikh sistem (Methods of Discrete Analysis in Synthesis of Control Systems), Vol. 32, pp. 21–33, Inst. Mat. SO AN SSSR, Novosibirsk, 1978.
[2] Yu. L. Vasil’ev and V. V. Glagolev, Metric properties of disjunctive normal forms, in Diskretnaya matematika i matematicheskie voprosy kibernetiki (Discrete Mathematics and Mathematical Problems of Cybernetics), Vol. 1, pp. 99–148, Nauka, Moscow, 1974.
[3] A. V. Eremeev, L. A. Zaozerskaya, and A. A. Kolokolov, The set covering problem: complexity, algorithms, and experimental study, Diskretn. Anal. Issled. Oper., Ser. 2, 7, No. 2, 22–46, 2000.
[4] V. K. Leont’ev, Discrete optimization, Zh. Vychisl. Mat. Mat. Fiz., 47, No. 2, 338–352, 2007. Translated in Comput. Math. Math. Phys., 47, No. 2, 328–340, 2007.
[5] I. P. Chukhrov, On minimal complexes of faces in the unit cube, Diskretn. Anal. Issled. Oper., 19, No. 3, 79–99, 2012.
[6] I. P. Chukhrov, On complexity measures of complexes of faces in the unit cube, Diskretn. Anal. Issled. Oper., 20, No. 6, 77–94, 2013. Translated in J. Appl. Ind. Math., 8, No. 1, 9–19, 2014.
[7] O. Coudert, On solving covering problems, in Proc. 33rd Design Automation Conf., Las Vegas, NV, USA, June 3–7, 1996, pp. 197–202, ACM, New York, 1996.
[8] O. Coudert and T. Sasao, Two-level logic minimization, in S. Hassoun and T. Sasao, eds., Logic Synthesis and Verification, pp. 1–27, Kluwer Acad. Publ., Norwell, MA, 2002. (Springer Int. Ser. Eng. Comp. Sci.; Vol. 654.) |