How Lower and Upper Complexity Bounds Meet in Elimination Theory

Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions

ISSAC '00 Proceedings of the 2000 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

Fast computation of discrete invariants associated to a differential rational mapping

Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)

Complexity results for triangular sets

Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)

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

On the probability distribution of singular varieties of given corank

Journal of Symbolic Computation

Evaluation techniques for zero-dimensional primary decomposition

Journal of Symbolic Computation

On the number of random digits required in montecarlo integration of definable functions

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

An Arithmetic Poisson Formula for the multi-variate resultant

Journal of Complexity