在这份报纸,一个新三角形的分解算法为平常的微分多项式系统被建议,它有三倍的指数的计算复杂性。钥匙想法到在一个从一套多项式消除一个代数学的变量用 multivariate 的理论的步结果。这似乎是有基本计算复杂性的第一个微分三角形的分解算法。
In this paper, a new triangular decomposition algorithm is proposed for ordinary differ- ential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of polynomials in one step using the theory of multivariate resultant. This seems to be the first differential triangular decomposition algorithm with elementary computation complexity.