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

DOI10.3103/S0278641914020083zbMATH Open1310.94245OpenAlexW2000525984MaRDI QIDQ2018642FDOQ2018642

Authors: 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

Recommendations

• Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
• On length of Boolean functions of a small number of variables in the class of pseudo-polynomials
• Upper bound for the length of functions over a finite field in the class of pseudopolynomials
• On complexity of a particular Boolean functions class
• Computational bound on complexity of polynomial representations of Boolean functions

zbMATH Keywords

lower boundBoolean functionlengthupper boundpolynomial formZhegalkin polynomialpolynomial representation of a Boolean function

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Complexity of Boolean functions in the class of canonical polarized polynomials
• Title not available (Why is that?)
• The multiplicative complexity of quadratic boolean forms

Cited In (5)

• On length of Boolean functions of a small number of variables in the class of pseudo-polynomials
• Upper bound for the length of functions over a finite field in the class of pseudopolynomials
• Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
• Title not available (Why is that?)
• On a small class of Boolean sums

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018642)