Complexity of Boolean functions' representations in classes of extended pair-generated operator forms

DOI10.33048/semi.2019.16.034zbMath1427.94119OpenAlexW3015813268MaRDI QIDQ2633615

Anastasiya Sergeevna Frantseva

Publication date: 9 May 2019

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33048/semi.2019.16.034

zbMATH Keywords

Boolean functionspolynomial normal formsexclusive-or sum-of-products expressionsextended pair-generated operator forms

Mathematics Subject Classification ID

Boolean functions (94D10)

Related Items (1)

Complexity lower bound for Boolean functions in the class of extended operator forms

Cites Work

• Unnamed Item
• The complexity of the representation of multiple-output Boolean functions
• Complexity of Boolean functions in the class of polarized polynomial forms
• Computational bound on complexity of polynomial representations of Boolean functions

This page was built for publication: Complexity of Boolean functions' representations in classes of extended pair-generated operator forms