Periodic Boolean functions and a lower bound for the complexity of operators (Q1878549)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Periodic Boolean functions and a lower bound for the complexity of operators |
scientific article; zbMATH DE number 2098946
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Periodic Boolean functions and a lower bound for the complexity of operators |
scientific article; zbMATH DE number 2098946 |
Statements
Periodic Boolean functions and a lower bound for the complexity of operators (English)
0 references
7 September 2004
0 references
The main result of the paper is a generalization of Lozhkin's estimates [\textit{S. A. Lozhkin}, Mat. Vopr. Kibern. 6, 189--214 (1996)] for the class \(\mathfrak F^{n_1,M}\) of all \(\,(n_1,M)\)-operators with an odd number of outputs \(M\).
0 references
\((n,m)\)-operators with odd number of outputs
0 references
