On an algorithm for constructing reduced DNF of order-prominent boolean functions / Timoshkin. (2019)
Ukrainian

English  Cybernetics and Systems Analysis   /     Issue (2019, 55 (1))

Timoshkin A.I.
On an algorithm for constructing reduced DNF of order-prominent boolean functions

This paper considers the problem of constructing reduced disjunctive normal forms of order-convex Boolean functions. An original algorithm is proposed for finding these forms. The algorithm uses concepts of the theory of ordered sets such as an ideal and a coideal and has a substantially lower time complexity than the classical Quine–McCluskey algorithm. © 2019, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: coideal, ideal, implicant, lattice, order-convex subset, Computer science, Cybernetics, coideal, ideal, implicant, lattice, order-convex subset, Boolean functions


Cite:
Timoshkin A.I. (2019). On an algorithm for constructing reduced DNF of order-prominent boolean functions. Cybernetics and Systems Analysis, 55 (1), 39-43. doi: https://doi.org/10.1007/s10559-019-00109-8 http://jnas.nbuv.gov.ua/article/UJRN-0000947553 [In Russian].


 

Institute of Information Technologies of VNLU


+38 (044) 525-36-24
Ukraine, 03039, Kyiv, Holosiivskyi Ave, 3, room 209