The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these relations and differences, making plain their interconvertibility. By revealing different types of multiplication relations in algebraic expressions and their elimination dependencies in line-graph, we establish a theoretical limit on the efficiency of face elimination.

中文翻译：

---

关于计算图和雅可比积的注释

计算图的最佳计算顺序可以由一组代数表达式表示。计算图和代数表达式都具有密切的联系和显着的区别，本文对这些联系和区别进行了研究，从而明确了它们之间的可互换性。通过在代数表达式中揭示不同类型的乘法关系及其在折线图中的消除依存关系，我们对人脸消除的效率建立了理论上的限制。