Complexity bounds in elimination theory — A survey Original Research Article

This paper is devoted to some last algorithmic progress in classical elimination theory from the complexity point of view. These results will be presented as a short survey (without proofs) treating essentially upper and lower bounds problems. The first aim of this paper is to show that the upper bounds results — as much progress as they may represent — seem not to solve satisfactorily the basic problems we are considering. On the other hand we shall also show how both the improvement of general algorithms and the research of lower bounds are related to certain mathematical tools as duality theory or arithmetic intersection theory.