A computational method for diophantine approximation

On the combinatorial and algebraic complexity of quantifier elimination

Journal of the ACM (JACM)

Solving some overdetermined polynomial systems

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation

A new algorithm for the geometric decomposition of a variety

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation

Functional programming concepts and straight-line programs in computer algebra

Mathematics and Computers in Simulation

Systems of rational polynomial equations have polynomial size approximate zeros on the average

Journal of Complexity

Cited References

Computer algebra handbook

Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers

Journal of Complexity

Polynomial equation solving by lifting procedures for ramified fibers

Theoretical Computer Science - Algebraic and numerical algorithm

Deformation techniques to solve generalised Pham systems

Theoretical Computer Science - Algebraic and numerical algorithm

Generalized polar varieties: geometry and algorithms

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage

Complexity of the resolution of parametric systems of polynomial equations and inequations

Proceedings of the 2006 international symposium on Symbolic and algebraic computation

On the complexity of the resolvent representation of some prime differential ideals

Journal of Complexity

Generalized polar varieties: geometry and algorithms

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage

Bezoutian and quotient ring structure

Journal of Symbolic Computation

Software Engineering and complexity in effective Algebraic Geometry

Journal of Complexity