@article{Grigorev:1992aa,
Abstract = {This article presents an algorithm for elimination of quantifiers in the theory of first-order ordinary differentially closed fields; the algorithm has elementary complexity. The previously known algorithm, due to A. Seidenberg, is of non-elementary complexity. In the description of the algorithm an important procedure is construction of a polynomial-time algorithm for finding the greatest common divisor of a family of polynomials in one variable with parametric coefficients. The GCD is itself a polynomial in several variables.},
Author = {Grigor'ev, D. Yu.},
File = {Complexity of quantifier elimination in the theory of ordinary differentially closed fields - 10.1007@bf01104105 - a - a - a - a - v.pdf},
ISBN = {1573-8795},
Journal = {Journal of Soviet Mathematics},
Number = {3},
Pages = {814--822},
Title = {Complexity of quantifier elimination in the theory of ordinary differentially closed fields},
URL = {https://doi.org/10.1007/BF01104105},
Volume = {59},
Year = {1992},
bdsk-url-1 = {https://doi.org/10.1007/BF01104105},
da = {1992/04/01},
date-added = {2020-04-09 14:31:19 +0200},
date-modified = {2020-04-09 14:31:19 +0200},
id = {Grigor'ev1992},
ty = {JOUR},
doi = {10.1007/BF01104105}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A