Lower cardinality-based estimates for the complexity of realization of functions from P_kby circuits of functional elements over an arbitrary basis

Articles in the same Issue

1. Lower cardinality-based estimates for the complexity of realization of functions from P_kby circuits of functional elements over an arbitrary basis
2. On some closed classes in partial two-valued logic
3. On realization of partitions of sets by circuits of functional elements
4. Coverings of Boolean graphs
5. On the minimax path in a network
6. Properties of matrices over a commutative ring related to the similarity relation
7. Lower bounds for sums of characters over finite fields
8. On the number of finite automata stabilized at a fixed state by a constant input
9. Ergodicity of conservative communication networks