A Computational program for the Newton polyhedron and the integral closure of ideals

Abstract

We describe the implementation of a computational programa that, for a given ideal with finite codimension in the ring of complex polynomials, constructs the Newton polyhedron and determines the integral closure of the ideal.