scientific article; zbMATH DE number 1285633

MaRDI QIDQ4242390zbMATH OpenFDO

Authors Yuri Vladimirovich Merekin

Publication date 10 May 1999

zbMATH Keywords

Boolean functioncomplexityconcatenation schemesupper estimate

Mathematics Subject Classification ID

Boolean functions (06E30) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Upper bounds for the complexity of sequences generated by symmetric Boolean functions
• scientific article; zbMATH DE number 1564048
• Upper bounds for the formula size of symmetric Boolean functions
• scientific article; zbMATH DE number 1396670
• Upper bounds on the depth of symmetric Boolean functions
• Upper bounds on the multiplicative complexity of symmetric Boolean functions
• scientific article; zbMATH DE number 1432161
• On the symmetric negabent Boolean functions
• On the Probabilistic Degrees of Symmetric Boolean Functions
• On the probabilistic degrees of symmetric Boolean functions

Cited in

(4)

• scientific article; zbMATH DE number 1564048 (Why is no real title available?)
• scientific article; zbMATH DE number 1396670 (Why is no real title available?)
• scientific article; zbMATH DE number 1432161 (Why is no real title available?)
• Upper bounds for the complexity of sequences generated by symmetric Boolean functions

This page was built for publication:

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