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

DOI10.3103/S0278641914020083zbMath1310.94245OpenAlexW2000525984MaRDI QIDQ2018642

Svetlana N. Selezneva

Publication date: 25 March 2015

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

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

zbMATH Keywords

upper boundlower boundlengthBoolean functionpolynomial formZhegalkin polynomialpolynomial representation of a Boolean function

Mathematics Subject Classification ID

Boolean programming (90C09) Boolean functions (06E30)

Related Items (3)

Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts ⋮ Upper bound for the length of functions over a finite field in the class of pseudopolynomials ⋮ On length of Boolean functions of a small number of variables in the class of pseudo-polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• The multiplicative complexity of quadratic boolean forms
• Complexity of Boolean functions in the class of canonical polarized polynomials

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