A lower bound on the complexity of realization of a Boolean function by two-layer contact circuits on the planar integer lattice

Articles in the same Issue

1. Fibre products of hyperelliptic curves and geometric Goppa codes
2. On the closed classes of multivalued logic containing the polynomial class
3. A lower bound on the complexity of realization of a Boolean function by two-layer contact circuits on the planar integer lattice
4. On the functional separability of Boolean threshold functions
5. On the completeness of systems of finite automata
6. Realization of hypergraphs by trees of minimal diameter
7. An analogue of the Whithey theorem for edge graphs of multigraphs, and edge multigraphs
8. On minimal universal graphs for hereditary classes
9. A conditional limit theorem for random number of summands
10. Large deviation probabilities for sums of lattice random vectors with heavy-tailed distribution