An Algorithm for Constructing Reduced DNFs of Order-Convex Boolean Functions
- 2 Downloads
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.
Keywordsimplicant lattice order-convex subset ideal coideal
Unable to display preview. Download preview PDF.
- 1.M. Aigner, Combinatorial Theory [Russian translation], Mir, Moscow (1982).Google Scholar
- 2.M. M. Kovalev, Matroids in Discrete Optimization [in Russian], Universitetskoe, Minsk (1987).Google Scholar
- 3.G. Birkhoff, Lattice Theory [Russian translation], Nauka, Moscow (1984).Google Scholar
- 4.S. V. Yablonskii, Introduction to Discrete Mathematics [in Russian], Nauka, Moscow (1986).Google Scholar