Geodesic
On the complexity of implementation of a~system of two monomials by composition circuits
Diskretnaya Matematika, Tome 32 (2020) no. 2, pp. 15-31.

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Keywords: system of monomials, composition circuit, circuit of gates, computational complexity, circuit complexity. 
@article{DM_2020_32_2_a1,
     author = {S. A. Korneev},
     title = {On the complexity of implementation of a~system of two monomials by composition circuits},
     journal = {Diskretnaya Matematika},
     pages = {15--31},
     publisher = {mathdoc},
     volume = {32},
     number = {2},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2020_32_2_a1/}
}
TY  - JOUR
AU  - S. A. Korneev
TI  - On the complexity of implementation of a~system of two monomials by composition circuits
JO  - Diskretnaya Matematika
PY  - 2020
SP  - 15
EP  - 31
VL  - 32
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2020_32_2_a1/
LA  - ru
ID  - DM_2020_32_2_a1
ER  - 
%0 Journal Article
%A S. A. Korneev
%T On the complexity of implementation of a~system of two monomials by composition circuits
%J Diskretnaya Matematika
%D 2020
%P 15-31
%V 32
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2020_32_2_a1/
%G ru
%F DM_2020_32_2_a1
S. A. Korneev. On the complexity of implementation of a~system of two monomials by composition circuits. Diskretnaya Matematika, Tome 32 (2020) no. 2, pp. 15-31. http://geodesic.mathdoc.fr/item/DM_2020_32_2_a1/

[1] Shirshov A. I., “Some algorithmic problems for Lie algebras”, Selected Works of A.I. Shirshov, Contemporary Mathematicians, Birkhäuser Basel, 125–130, 242 pp.

[2] Merekin Yu. V., “O porozhdenii slov s ispolzovaniem operatsii kompozitsii”, Diskretn. analiz i issled. oper., ser. 1, 10:4 (2003), 70–78 | MR | Zbl

[3] Trusevich E. N., “Complexity of certain systems of monomials in calculation by composition circuits”, Moscow Univ. Math. Bull., 69:5 (2014), 193–197 | DOI | MR

[4] Lupanov O. B., Asimptoticheskie otsenki slozhnosti upravlyayuschikh sistem, izd-vo Mosk. un-ta, Moskva, 1984, 138 pp.

[5] Kochergin V. V., “O slozhnosti sovmestnogo vychisleniya trekh odnochlenov ot trekh peremennykh”, Matem. voprosy kibern. Vyp. 15., 2006, 79–154

[6] Kochergin V. V., “Relation between two measures of the computation complexity for systems of monomials”, Moscow Univ. Math. Bull., 64 (2009), 144–149