On the complexity of realization of the linear function by formulas over finite Boolean bases

Articles in the same Issue

1. Titelei
2. Limit theorems for the number of non-zero solutions of a system of random equations over GF(2)
3. Pseudo-geometric graphs of the partial geometries pG₂(4, t)
4. On the complexity of realization of the linear function by formulas over finite Boolean bases
5. On the complexity of realization of finite languages by formulas
6. On the complexity of the disjunctive normal form of threshold functions
7. Crossed homomorphisms of finite algebras with a scheme of binary operators
8. On recognizing labyrinths by automata