Upper bounds for the complexity of sequences generated by symmetric Boolean functions

DOI10.1016/S0166-218X(00)00371-1MaRDI QIDQ5954093zbMATH OpenOpenAlexFDO

Authors Yuri Vladimirovich Merekin

Publication date 20 January 2003

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(00)00371-1

zbMATH Keywords

belt symmetric functionscomplexityconcatenation schemessymbol sequencessymmetric Boolean functionsupper bound

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1285633
• Asymptotically minimal schemes for one sequence of Boolean functions
• scientific article; zbMATH DE number 1564048
• scientific article; zbMATH DE number 1396670
• scientific article; zbMATH DE number 1432161

Cites work

• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 919273 (Why is no real title available?)
• On the Complexity of Finite Sequences

Cited in

(7)

• Upper bounds on the multiplicative complexity of symmetric Boolean functions
• Upper bounds on the imbalance of discrete functions implemented by sequences of finite automata
• scientific article; zbMATH DE number 1285633 (Why is no real title available?)
• scientific article; zbMATH DE number 1564048 (Why is no real title available?)
• scientific article; zbMATH DE number 1855659 (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?)

This page was built for publication: Upper bounds for the complexity of sequences generated by symmetric Boolean functions

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