In this paper we describe a recent computer implementation (the PASCAL program TERA) of a well known Computer Algebra algorithm. The particularity of this implementation consists in the fact that it is based on a special abstract data type, namely that of a directed acyclic graph (DAG) which is...

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...