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

DOI10.1016/S0166-218X(00)00371-1zbMath1003.94050OpenAlexW2052598487MaRDI QIDQ5954093

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

complexityupper boundbelt symmetric functionsconcatenation schemessymbol sequencessymmetric Boolean functions

Mathematics Subject Classification ID

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

Cites Work

• On the Complexity of Finite Sequences
• Unnamed Item
• Unnamed Item

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