On the intrinsic complexity of elimination theory

Abstract : We consider the intrinsic complexity of selected algorithmic problems of classical elimination theory in algebraic geometry. The inputs and outputs of these problems are given by finite sets of polynomials which we represent alternatively in dense forme or by straight line programs. We begin with an overview on the known upper bounds for the sequential and parallel time complexity of these problems and show then that in the most important cases these bounds are tight. Our lower bound results include both the relative and the absolute viewpoint of complexity theory. On one side we give reductions of fundamental questions of elimination theory to NP- and P#- complete problems and on the other side we show that some of these questions may have exponential size outputs. In this way we confirm the intrinsically exponential character of algorithmic problems in elimination theory whatever the type of data structure may be.
Type de document :
[Research Report] RR-1923, INRIA. 1993
Liste complète des métadonnées

Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 16:13:57
Dernière modification le : samedi 27 janvier 2018 - 01:31:05
Document(s) archivé(s) le : mardi 12 avril 2011 - 18:58:36



  • HAL Id : inria-00074751, version 1



Joos Heintz, Jacques Morgenstern. On the intrinsic complexity of elimination theory. [Research Report] RR-1923, INRIA. 1993. 〈inria-00074751〉



Consultations de la notice


Téléchargements de fichiers