On complexity of a class of circuits with computationally weak multi-output gates
Abstract:
The article continues previous research on the Shannon function of logic circuits with gates that have m inputs and m outputs, considering now bases that are restricted to rather simple Boolean functions instead of containing arbitrary gates of that type. As previously, m grows alongside with n, the argument of the Shannon function. The Shannon function asymptotic is obtained for a series of bases.