The Computational Complexity of the Resolution of Plane Curve Singularities
- 1 April 1990
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 54 (190), 797-837
- https://doi.org/10.2307/2008513
Abstract
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 k-operations necessary to compute the resolution and the conductor ideal of the singularity. We show that the number of k-operations is polynomially bounded by the complexity of the singularity, as measured for example by the index of its conductor ideal. Our algorithm involves calculations over reduced rings with zero divisors, and employs methods of deformation theory to reduce the consideration of power series to the consideration of polynomials.Keywords
This publication has 9 references indexed in Scilit:
- Computations on curvesPublished by Springer Nature ,2005
- On expansion of algebraic functions in power and Puiseux series, IJournal of Complexity, 1986
- Fast parallel absolute irreducibility testingJournal of Symbolic Computation, 1985
- Computer AlgebraPublished by Springer Nature ,1983
- An algorithm to compute the equations of tangent conesLecture Notes in Computer Science, 1982
- A criterion for detecting unnecessary reductions in the construction of Gröbner-basesLecture Notes in Computer Science, 1979
- All Algebraic Functions Can Be Computed FastJournal of the ACM, 1978
- Construction of rational functions on a curveMathematical Proceedings of the Cambridge Philosophical Society, 1970
- An Arithmetic Theory of Adjoint Plane CurvesTransactions of the American Mathematical Society, 1952