A study on monotone self-dual Boolean functions
- 49 Downloads
This paper shows that monotone self-dual Boolean functions in irredundant disjuntive normal form (IDNF) do not have more variables than disjuncts. Monotone self-dual Boolean functions in IDNF with the same number of variables and disjuncts are examined. An algorithm is proposed to test whether a monotone Boolean function in IDNF with n variables and n disjuncts is self-dual. The runtime of the algorithm is O(n3).
Keywordsduality problem monotone Boolean functions self-dual Boolean functions
2000 MR Subject Classification03-XX: Mathematical logic and foundations 05-XX: Combinatorics
Unable to display preview. Download preview PDF.
- Altun, M., Riedel, M.D. Lattice-based computation of Boolean functions. In: Design Automation Conference, 2010, 609–612Google Scholar
- Gottlob, G. Deciding monotone duality and identifying frequent itemsets in quadratic logspace. arXiv: 1212.1881 (2012)Google Scholar