Abstract
Abstract 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
