We provide a setting for analyzing the efficiency of algorithms that compute the in- tegral closure of affine rings. It gives quadratic (cubic in the non-homogeneous case) multiplicity-based but dimension-independent bounds for the number of passes the ba- sic construction will make. An approach that does not uses Jacobian ideals is examined in detail.
展开▼
