Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts

DOI10.3103/S0278641916030043zbMath1351.94098OpenAlexW4238995141MaRDI QIDQ344027

Svetlana N. Selezneva

Publication date: 22 November 2016

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641916030043

zbMATH Keywords

upper boundlengthBoolean functionpolynomial formexclusive-OR sum of pseudoproductsmultiaffine functionZhegalkin polynomial

Mathematics Subject Classification ID

Related Items (1)

On length of Boolean functions of a small number of variables in the class of pseudo-polynomials

Cites Work

• Asymmetric binary covering codes.
• Complexity of Boolean functions in the class of polarized polynomial forms
• On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
• Complexity of Boolean functions in the class of canonical polarized polynomials
• An upper bound for complexity of polynomial normal forms of Boolean functions

This page was built for publication: Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts