On the multiplicative complexity of some Boolean functions

DOI10.1134/S0965542515040119zbMath1351.94097OpenAlexW319001346MaRDI QIDQ2354498

Svetlana N. Selezneva

Publication date: 13 July 2015

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542515040119

zbMATH Keywords

complexityupper boundcircuitBoolean functionmultiplicative complexity

Mathematics Subject Classification ID

Boolean functions (06E30) Descriptive complexity and finite models (68Q19)

Cites Work

• Unnamed Item
• 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
• The complexity of satisfiability problems

This page was built for publication: On the multiplicative complexity of some Boolean functions