Recent theoretical advances in elimination theory use straight-line program
s as a data structure to represent multivariate polynomials. We present her
e the Projective Noether Package which is a Maple implementation of one of
these new algorithms, yielding as a byproduct a computation of the dimensio
n of a projective variety. Comparative results on benchmarks for time and s
pace of several families of multivariate polynomial equation systems are gi
ven and we point out both weaknesses and advantages of different approaches
. (C) 2000 Academic Press.