A Simple Proof for the Upper Bound of the Computational Complexity of Three Monomials in Three Variables

D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms (Addison-Wesley Longman Publ., Boston, MA, 1997; Mir, Moscow, 1977).

N. Pippenger, “On Evaluation of Powers and Monomials,” SIAM J. Comput. 9 (2), 230 (1980).

V. V. Kochergin, “On Bellman’s and Knuth’s Problems and their Generalizations,” Fundament. Prikladn. Matem. 20 (6), 159 (2015) [J. Math. Sci. 233 (1), 103 (2018)]

V. V. Kochergin, “Asymptotics of the Complexity of Systems of Integer Linear Forms for Additive Computations,” Discr. Analiz Issled. Oper., Ser. 1 13 (2), 38, (2006) [J. Appl. Indust. Math. 1 (3), 328 (2007)].

V. V. Kochergin, “The Complexity of Additive Computations Using Only Subtraction Operations,” in: Proc. VIII Int. Conf. “Discrete Models in Control Systems Theory” (Moscow, April 6–9, 2009) (MAKS Press, Moscow, 2009), pp. 174–179.

V. V. Kochergin, “Relation Between Two Measures of the Computation Complexity for Systems of Monomials,” Vestn. Mosk. Univ., Matem. Mekhan., No. 4, 8 (2009) [Moscow Univ. Math. Bulletin 64 (4), 144 (2009)]

V. V. Kochergin, “The Complexity of Computation of a System of Three Monomials on Three Variables,” in: Mathem. Problems of Cybernetics, Issue 15 (Fizmatlit, Moscow, 2006), pp. 79–155.

O. B. Lupanov, “On Synthesis of Some Classes of Control Systems,” in: Problems of Cybernetics, Issue 10 (Fizmatgiz, Moscow, 1963), pp. 63–97.

A. Brauer, “On Addition Chains,” Bull. Amer. Math. Soc. 45, 736 (1939).

V. V. Kochergin, “On the Computational Complexity of System of Monomials in Two Variables,” in: Proc. VII Int. Conf. “Discrete Models in Control Systems Theory” (MAKS PRESS, Moscow, 2006), pp. 185–190.