|
Prikladnaya Diskretnaya Matematika, 2009, Number 1(3), Pages 5–14
(Mi pdm49)
|
|
|
|
Theoretical Foundations of Applied Discrete Mathematics
Minimization of Boolean functions of many variables – iterative method and program realization
A. D. Zakrevskij, N. R. Toropov United Institute of Informatics Problems of the National Academy of Sciences of Belarus, Minsk, Belarus
Abstract:
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$.
Citation:
A. D. Zakrevskij, N. R. Toropov, “Minimization of Boolean functions of many variables – iterative method and program realization”, Prikl. Diskr. Mat., 2009, no. 1(3), 5–14
Linking options:
https://www.mathnet.ru/eng/pdm49 https://www.mathnet.ru/eng/pdm/y2009/i1/p5
|
Statistics & downloads: |
Abstract page: | 1998 | Full-text PDF : | 1070 | References: | 90 | First page: | 1 |
|