×

zbMATH — the first resource for mathematics

Upper estimates of symbol sequences generated by symmetric Boolean functions. (Russian) Zbl 0913.94027
A square upper estimate of complexity is obtained for symbol sequences generated by symmetric Boolean functions in a class of concatenation schemes.
For some classes of schemes, more precise (for example, linear) estimates are also given.
MSC:
94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010)
06E30 Boolean functions
68Q25 Analysis of algorithms and problem complexity
PDF BibTeX XML Cite