BibTeX
@MISC{Giusti_kronecker'ssmart,,
author = {Marc Giusti and Joos Heintz},
title = {Kronecker's Smart, Little Black Boxes},
year = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper is devoted to the complexity analysis of certain uniformity properties owned by all known symbolic methods of parametric polynomial equation solving (geometric elimination). It is shown that any parametric elimination procedure which is parsimonious with respect to branchings and divisions must necessarily have a non-polynomial sequential time complexity, even if highly ecient data structures (as e.g. the arithmetic circuit encoding of polynomials) are used.
