  This paper is devoted to the complexity analysis of a particular property,
called "algebraic robustness" owned by all known symbolic methods of parametric
polynomial equation solving (geometric elimination). It is shown that any
parametric elimination procedure which owns this property must neccessarily
have an exponential sequential time complexity.
