On the Time-Space Complexity of Geometric Elimination Procedures (1999)
by
Joos Heintz
,
Guillermo Matera
,
Ariel Waissbein
| Citations: | 20 - 13 self |
BibTeX
@MISC{Heintz99onthe,
author = {Joos Heintz and Guillermo Matera and Ariel Waissbein},
title = {On the Time-Space Complexity of Geometric Elimination Procedures},
year = {1999}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In [25] and [22] a new algorithmic concept was introduced for the symbolic solution of a zero dimensional complete intersection polynomial equation system satisfying a certain generic smoothness condition. The main innovative point of this algorithmic concept consists in the introduction of a new geometric invariant, called the degree of the input system, and the proof that the most common elimination problems have time complexity which is polynomial in this degree and the length of the input.
