Minimization of Boolean functions of many variables – iterative method and program realization
Prikladnaâ diskretnaâ matematika, no. 1 (2009), pp. 5-14
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
An iterative method for minimization of Boolean functions depending on the large number $n$ (up to 25) of variables is proposed. The method is based on applying effective parallel operations on Boolean vectors of length $2^n$.
[1] Zakrevskii A. D., Logicheskii sintez kaskadnykh skhem, M., 1981 | MR | Zbl
[2] Zakrevskij A. D., “Parallel operations over neighbors in Boolean space”, Proceedings of the Sixth International Conference CAD DD-07, V. 2, Minsk, 2007, 613
[3] Zakrevskii A. D., “Programmirovanie vychislenii v mnogomernom bulevom prostranstve”, 7-ya Rossiiskaya konf. s mezhdunarodnym uchastiem “Novye informatsionnye tekhnologii v issledovanii slozhnykh struktur”, Tomsk, 2008