The intrinsic complexity of parametric elimination methods

Simple item page
dc.creatorHeintz, J.
dc.creatorMatera, G.
dc.creatorPardo, L. M.
dc.creatorWachenchauzer, R.
dc.date1997-07-09
dc.date.accessioned2026-07-07T09:07:20Z
dc.date.available2026-07-07T09:07:20Z
dc.descriptionThis 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.
dc.descriptionLaTeX, 12 pages. To appear in Proc. of WAIT'97, Buenos Aires, Argentina, 1997
dc.identifierhttps://arxiv.org/abs/alg-geom/9707006
dc.identifierhttp://arxiv.org/abs/alg-geom/9707006
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/150338
dc.subjectAlgebraic Geometry
dc.titleThe intrinsic complexity of parametric elimination methods
dc.typetext

Files

Collections

arXiv