On the mean evaluation of polynomially reducible Boolean functions

MaRDI QIDQ5936693zbMATH OpenFDO

Authors A. V. Chashkin

Publication date 4 July 2001

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

average time of computationBoolean functions

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• Approximate evaluations of characteristic polynomials of Boolean functions
• Computational bound on complexity of polynomial representations of Boolean functions
• scientific article; zbMATH DE number 3867065
• Complexity of Boolean functions in a class of canonical polarized polynomials
• On the multiplicative complexity of some Boolean functions
• Lower Bounds on Representing Boolean Functions as Polynomials in Z_m
• scientific article; zbMATH DE number 4179291
• Complexity of Boolean functions in the class of polarized polynomial forms
• Complexity of Boolean functions in the class of canonical polarized polynomials
• On the multiplicative complexity of Boolean functions

Cited in

(2)

• Mean computing time of Boolean operators by programs with restricted memory
• Approximate evaluations of characteristic polynomials of Boolean functions

This page was built for publication: On the mean evaluation of polynomially reducible Boolean functions

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