Ask a Question

Prefer a chat interface with context about you and your work?

The computational complexity of the resolution of plane curve singularities

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 <italic>k</italic> of characteristic zero. We estimate the number of <italic>k</italic>-operations necessary to compute the resolution and the conductor ideal of …