The Shannon function is investigated for logic circuits with gates from the basis that contains all possible Boolean operators with m inputs and m outputs. We consider the case of values of m that grow alongside with n, the argument of the Shannon function. If m grows 'slowly', the asymptotic behavior of the Shannon function may be obtained by Lupanov's method. We establish the Shannon function asymptotic for the remaining range of possible values of m.

circuit, Shannon function

Mathematical problems and theory of numerical methods