On length of Boolean functions of a small number of variables in the class of pseudo-polynomials
From MaRDI portal
Publication:2215245
DOI10.26516/1997-7670.2020.33.96zbMath1458.94334OpenAlexW3086514641MaRDI QIDQ2215245
Alekseĭ Andreevich Lobanov, Svetlana N. Selezneva
Publication date: 11 December 2020
Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)
Full work available at URL: http://mathizv.isu.ru/en/article/file?id=1355
Boolean functionZhegalkin polynomialclassification by lengthEXOR sum of pseudo-products (ESPP)pseudo-polynomial formPSPF
Cites Work
- Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
- Complexity of Boolean functions in the class of polarized polynomial forms
- On complexity of a particular Boolean functions class
- On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
- Complexity lower bound for Boolean functions in the class of extended operator forms
- An upper bound for complexity of polynomial normal forms of Boolean functions