On the complexity of system of two monomials realization by composition circuits
S. A. Korneev
Lomonosov Moscow State University
In this paper we study the curcuit complexity of monomials systems computation. In the considered computational model complexity means the minimal number of composition operations sufficient to compute the system of monomials. The main result of given paper — the exact formula for curcuit compexity of two-monomial system computation is established.
set of monomials, composition curcuit, circuit of functional elements, computational complexity, curcuit complexity.
PDF file (494 kB)
First page: PDF file
S. A. Korneev, “On the complexity of system of two monomials realization by composition circuits”, Diskr. Mat., 32:2 (2020), 15–31
Citation in format AMSBIB
\paper On the complexity of system of two monomials realization by composition circuits
\jour Diskr. Mat.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|