Complexity of computation of embedded resolution of algebraic curves

DOI10.1007/3-540-51517-8_143zbMath1209.14004OpenAlexW1553831777MaRDI QIDQ5393367

Michel Merle, Jean-Pierre Henry

Publication date: 16 April 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-51517-8_143

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Global theory and resolution of singularities (algebro-geometric aspects) (14E15) Singularities of curves, local rings (14H20) Software, source code, etc. for problems pertaining to algebraic geometry (14-04)

Related Items (5)

Generating approximate parametric roots of parametric polynomials ⋮ Complexity bounds for the rational Newton-Puiseux algorithm over finite fields ⋮ Polynomial root finding over local rings and application to error correcting codes ⋮ Good reduction of Puiseux series and applications ⋮ Linear differential operators for polynomial equations

This page was built for publication: Complexity of computation of embedded resolution of algebraic curves