TY  - JOUR
AU  - V. V. Kochergin
TI  - A simple proof for the upper bound of the computational complexity of three monomials in three variables
JO  - Vestnik Moskovskogo universiteta. Matematika, mehanika
PY  - 2019
SP  - 3
EP  - 8
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMUMM_2019_2_a0/
LA  - ru
ID  - VMUMM_2019_2_a0
ER  -