An optimization of Seidenbergʹs elimination algorithm in differential algebra Original Research Article

Seidenbergʹs elimination algorithm computes a projection of the algebraic differential manifold associated with a system of differential polynomials (here with coefficients in an ordinary differential field of characteristic zero). Found in 1956, the original version of the procedure cannot be efficiently carried out on a computer. In this paper, we describe a new version of the algorithm with a simple and efficient termination proof.