On the complexity of implementation of a system of two monomials by composition circuits
Sergey A. Korneev · Discrete Mathematics and Applications · 2021
Abstract The complexity of implementation of systems of monomials by composition circuits is studied. In such a model, the complexity is understood as the smallest number of composition operations required for computation of a system of monomials. The main result is an exact formula which, for an arbitrary pair of monomials, gives the complexity of their joint implementation by composition circuits.