The intrinsic complexity of parametric elimination methods
classification
alg-geom
math.AG
keywords
complexityeliminationparametricmethodspropertyalgebraicanalysiscalled
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.