The intrinsic complexity of parametric elimination methods
alg-geom
2008-02-03 v1 代数几何
摘要
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.
引用
@article{arxiv.alg-geom/9707006,
title = {The intrinsic complexity of parametric elimination methods},
author = {J. Heintz and G. Matera and L. M. Pardo and R. Wachenchauzer},
journal= {arXiv preprint arXiv:alg-geom/9707006},
year = {2008}
}
备注
LaTeX, 12 pages. To appear in Proc. of WAIT'97, Buenos Aires, Argentina, 1997