Complexity of Boolean functions in a class of canonical polarized polynomials

DOI10.1007/BF02733001MaRDI QIDQ5951317zbMATH OpenFDO

Authors A. N. Alekseichuck

Publication date 17 November 2002

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02733001

zbMATH Keywords

Boolean functionpolarized polynomials

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• Complexity of Boolean functions in the class of canonical polarized polynomials
• Complexity of Boolean functions in the class of polarized polynomial forms
• scientific article; zbMATH DE number 4002032
• On complexity of a particular Boolean functions class
• An upper bound for complexity of polynomial normal forms of Boolean functions

Cites work

• Complexity of Boolean functions in the class of canonical polarized polynomials
• scientific article; zbMATH DE number 919301 (Why is no real title available?)
• Polynomial expansions of Boolean functions

Cited in

(7)

• Complexity of Boolean functions in the class of polarized polynomial forms
• On complexity of a particular Boolean functions class
• scientific article; zbMATH DE number 4002032 (Why is no real title available?)
• Complexity of Boolean functions in the class of canonical polarized polynomials
• On the mean evaluation of polynomially reducible Boolean functions
• Approximate evaluations of characteristic polynomials of Boolean functions
• Properties of polynomials of periodic functions and the complexity of periodicity detection by the Boolean function polynomial

This page was built for publication: Complexity of Boolean functions in a class of canonical polarized polynomials

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