On complexity of a particular Boolean functions class

MaRDI QIDQ1943910zbMATH OpenFDO

Authors Alekseĭ Sergeevich Kazimirov, Sergeĭ Fedorovich Vinokurov

Publication date 3 April 2013

Published in The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexityBoolean functionoperatorpolynomialexor-sum-of-products

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Complexity of Boolean functions in the class of polarized polynomial forms
• Computational bound on complexity of polynomial representations of Boolean functions
• Complexity of Boolean functions' representations in classes of extended pair-generated operator forms
• On the multiplicative complexity of some Boolean functions
• Complexity of Boolean functions in a class of canonical polarized polynomials

Cited in

(28)

• On the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• On the complexity of Boolean functions with small number of ones
• On length of Boolean functions of a small number of variables in the class of pseudo-polynomials
• On the parity complexity measures of Boolean functions
• Complexity of Linear Boolean Operators
• Complexity of sequential implementation of partial Boolean functions
• The complexity of Boolean function implementation in some classes of automaton circuits
• On the complexity of balanced Boolean functions
• scientific article; zbMATH DE number 7310075 (Why is no real title available?)
• scientific article; zbMATH DE number 4137717 (Why is no real title available?)
• Critical properties and complexity measures of read-once Boolean functions
• scientific article; zbMATH DE number 176868 (Why is no real title available?)
• On the positive and the inversion complexity of Boolean functions
• Complexity of Boolean functions in a class of canonical polarized polynomials
• Boolean complexity classes vs. their arithmetic analogs
• The complexity of Boolean functions in different characteristics
• On the cardinality spectrum and the number of Latin bitrades of order 3
• On the complexity of the evaluation of transient extensions of Boolean functions
• Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts
• On Deciding Whether a Boolean Function is Constant or Not
• Computational bound on complexity of polynomial representations of Boolean functions
• Complexity of Boolean functions in the class of polarized polynomial forms
• Complexity lower bound for Boolean functions in the class of extended operator forms
• Local complexity of Boolean functions
• Complexity of Boolean functions' representations in classes of extended pair-generated operator forms
• On the computational power of Boolean decision lists
• On the computational complexity of some classical equivalence relations on boolean functions

This page was built for publication: On complexity of a particular Boolean functions class

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