The problem of the minimal number of multiplication operations sufficient for joint computing three monomials in three variables is considered. For this problem, we propose a simple proof of the upper bound that is asymptotically equal to the lower bound. The known proof of a similar bound contains more than 60 pages.

中文翻译：

---

三个变量中三个单项式的计算复杂度上界的简单证明

考虑了足以联合计算三个变量中的三个单项式的最小乘法运算问题。对于此问题，我们提出了一个渐近等于下界的上限的简单证明。相似范围的已知证明包含60多页。