On a class of bases for Boolean functions
Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part XI, Tome 358 (2008), pp. 271-281
Citer cet article
Voir la notice du chapitre de livre provenant de la source Math-Net.Ru
We prove that up to congruence there exist exactly fourty-four primitive bases of Boolean functions. We also apply our results in order to improve an algorithm of finding maximal strong depth of a Boolean function. Bibl. – 4 titles.
[1] E. Lehtonen, “Descending chains and antichains of the unary, linear, and monotone subfunction relations”, Order, 23 (2006), 129–142 | DOI | MR | Zbl
[2] E. L. Post, The Two-valued Iterative Systems of Mathematical Logic, Princeton Univ. Press, Princeton, NJ, 1941 | MR | Zbl
[3] D. Skordev, “Maximal depths of Boolean functions”, Annuaire de l' Univ. de Sofia, Fac. de Math. et Inform., 96 (2004), 89–99 | MR | Zbl
[4] I. E. Zverovich, “Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes”, Discrete Applied Mathematics, 149 (2005), 200–218 | DOI | MR | Zbl