The intrinsic complexity of parametric elimination methods
J. Heintz, G. Matera, L. M. Pardo, R. Wachenchauzer
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.
Create a lesson
Related papers
Complements on surfaces
V. V. Shokurov
Isolated rational curves on K3-fibered Calabi-Yau threefolds
Torsten Ekedahl, Trygve Johnsen, Dag Einar Sommervoll
Cohomology of complete intersections in toric varieties
Anvar R. Mavlyutov
The Gross-Kohnen-Zagier theorem in higher dimensions
Richard E. Borcherds
Real deformations and complex topology of plane curve singularities
Norbert A'Campo
Irreducibility of the moduli space of vector bundles on surfaces and Brill-Noether theory on singular curves
Tomas L. Gomez