On the multiplicative complexity of quasi-quadratic Boolean functions

DOI10.3103/S0278641915010069zbMath1331.94093OpenAlexW2067261343MaRDI QIDQ2356508

Svetlana N. Selezneva

Publication date: 30 July 2015

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

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

zbMATH Keywords

upper boundlower boundquadratic functionBoolean functionmultiplicative complexityZhegalkin polynomialquasi-quadratic function

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• The multiplicative complexity of quadratic boolean forms
• On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
• Circuit Complexity and Multiplicative Complexity of Boolean Functions

This page was built for publication: On the multiplicative complexity of quasi-quadratic Boolean functions