In this paper we research a model of multilayer circuits with a single logical layer. We consider $\lambda$-separable graphs as a support for circuits. We establish the Shannon function lower bound $\max \bigl(\frac{2^n}{n}, \frac{2^n (1 - \lambda)}{\log k} \bigr)$ for this type of circuits where $k$ is the number of layers. For $d$-dimensional graphs, which are $\lambda$-separable for $\lambda = \frac{d - 1}{d}$, this gives the Shannon function lower bound $\frac{2^n}{\min(n, d \log k)}$. For multidimensional rectangular circuits the proved lower bound asymptotically matches to the upper bound.

Thanks. We have received your report. If we find this content to be in
violation of our guidelines,
we will remove it.

Ok