The Computational Complexity of the Resolution of Plane Curve Singularities

DOI10.2307/2008513zbMath0716.14035OpenAlexW4253495835MaRDI QIDQ3203147

Jeremy T. Teitelbaum

Publication date: 1990

Full work available at URL: https://doi.org/10.2307/2008513

zbMATH Keywords

complexityMilnor numberplane algebroid curvealgorithm for resolution of a singularityblow- ups

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Global theory and resolution of singularities (algebro-geometric aspects) (14E15) Computational aspects of algebraic curves (14Q05) Singularities of curves, local rings (14H20)

Related Items

A quasi-linear irreducibility test in \(\mathbb{K}x[y\)], A fast algorithm for curve singularities, Algorithms in Algebraic Number Theory, Complexity bounds for the rational Newton-Puiseux algorithm over finite fields, Irreducibility criterion for algebroid curves, Computing the equisingularity type of a pseudo-irreducible polynomial, Approximating rings of integers in number fields, A Polynomial Time Complexity Bound for Computations on Curves, Linear differential operators for polynomial equations

Uses Software

• Maple
• MACSYMA

Cites Work

• Fast parallel absolute irreducibility testing
• On expansion of algebraic functions in power and Puiseux series. II
• Resolution of singularities of an algebraic variety over a field of characteristic zero. I
• On Coates algorithm
• All Algebraic Functions Can Be Computed Fast
• An Arithmetic Theory of Adjoint Plane Curves
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item