On Approximate GCDs of Univariate Polynomials

Solving systems of polynomial inequalities in subexponential time

D. Yu. Grigor'ev, Nicolai Vorobjov · Journal of Symbolic Computation · 1988 · 332 citations

Computing, Computer Science, Mathematics +10

Subresultants and Reduced Polynomial Remainder Sequences

George E. Collins · Journal of the ACM · 1967 · 330 citations

Computing, Computer Science, Algebra +9

On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination

James Renegar · Journal of Symbolic Computation · 1992 · 277 citations

Computing, Computer Science, Mathematics +13

On Euclid's Algorithm and the Theory of Subresultants

Warren S. Brown, J. F. Traub · Journal of the ACM · 1971 · 258 citations · Full text

Computing, Computer Science, Algorithms +4

The Calculation of Multivariate Polynomial Resultants

George E. Collins · Journal of the ACM · 1971 · 241 citations · Full text

Natural Sciences, Computer Science, Multivariate Visualization +6