Recent theoretical advances in elimination theory use straight-line programs as a data structure to represent multivariate polynomials. We present here the Projective Noether Package which is a Maple implementation of one of these new algorithms, yielding as a byproduct a computation of the dimension of a projective variety. Comparative Results on benchmarks for time and space of several families of multivariate polynomial Equation systems are given and we point out both weaknesses and advantages of different approaches.
展开▼
