On the Computational Complexity of the Resolution of Plane Curve Singularities


We present an algorithm which computes the resolution of a plane curve singularity at the origin defined by a power series with coefficients in a (not necessarily algebraically closed) field k of characteristic zero. We estimate the number of £-operations necessary to compute the resolution and the conductor ideal of the singularity. We show that the number… (More)
DOI: 10.1007/3-540-51084-2_27


  • Presentations referencing similar topics