The intrinsic complexity of parametric elimination methods

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
LaTeX, 12 pages. To appear in Proc. of WAIT'97, Buenos Aires, Argentina, 1997

Keywords

Algebraic Geometry

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/150338

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/alg-geom/9707006
 http://arxiv.org/abs/alg-geom/9707006

Collections

arXiv