arXiv · alg-geom/9707006
The intrinsic complexity of parametric elimination methods
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.
Explore related subjects
Keep this discovery
J. Heintz, G. Matera, L. M. Pardo, R. Wachenchauzer. 1997-07-09. The intrinsic complexity of parametric elimination methods. https://arxiv.org/abs/alg-geom/9707006
Cite the original work for its findings. Save a collection to share your selection of sources.