Minimization of Boolean functions of many variables – iterative method and program realization
Prikladnaâ diskretnaâ matematika, no. 1 (2009), pp. 5-14
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$.
@article{PDM_2009_1_a0,
author = {A. D. Zakrevskij and N. R. Toropov},
title = {Minimization of {Boolean} functions of many variables~{\textendash} iterative method and program realization},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {5--14},
year = {2009},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2009_1_a0/}
}
TY - JOUR AU - A. D. Zakrevskij AU - N. R. Toropov TI - Minimization of Boolean functions of many variables – iterative method and program realization JO - Prikladnaâ diskretnaâ matematika PY - 2009 SP - 5 EP - 14 IS - 1 UR - http://geodesic.mathdoc.fr/item/PDM_2009_1_a0/ LA - ru ID - PDM_2009_1_a0 ER -
A. D. Zakrevskij; N. R. Toropov. Minimization of Boolean functions of many variables – iterative method and program realization. Prikladnaâ diskretnaâ matematika, no. 1 (2009), pp. 5-14. http://geodesic.mathdoc.fr/item/PDM_2009_1_a0/
[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