On the ratio of the complexities for the realization of some boolean functions by the schemes of two types

Two different types of the schemes from functional elements are considered in the paper. The main goal is to estimate from below the complexity of the realization of boolean functions by the schemes of the first type. This problem is reduced to the estimation from above of the realization of the same functions by the schemes of the second type. In particular, this method gives a sharp estimate from below for the representation of the binary tree graph as the cell structured complex.