The Computational Complexity of the Resolution of Plane Curve Singularities
From MaRDI portal
Publication:3203147
DOI10.2307/2008513zbMATH Open0716.14035OpenAlexW4253495835MaRDI QIDQ3203147FDOQ3203147
Publication date: 1990
Full work available at URL: https://doi.org/10.2307/2008513
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Global theory and resolution of singularities (algebro-geometric aspects) (14E15) Singularities of curves, local rings (14H20) Computational aspects of algebraic curves (14Q05)
Cites Work
- Resolution of singularities of an algebraic variety over a field of characteristic zero. I
- All Algebraic Functions Can Be Computed Fast
- An Arithmetic Theory of Adjoint Plane Curves
- On expansion of algebraic functions in power and Puiseux series. II
- Fast parallel absolute irreducibility testing
- On Coates algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- Irreducibility criterion for algebroid curves
- Title not available (Why is that?)
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
- Computing resolution invariants of a cyclic surface singularity with MAPLE
- Computing the equisingularity type of a pseudo-irreducible polynomial
- On the intrinsic complexity of point finding in real singular hypersurfaces
- Approximating rings of integers in number fields
- On resolution complexity of plane curves
- Resolution of space curves complexity
- [[Publication:2149947|A quasi-linear irreducibility test in \(\mathbb{K}x[y]\)]]
- Linear differential operators for polynomial equations
- Algorithms in Algebraic Number Theory
- Effective computation of singularities of parametric affine curves
- A fast algorithm for curve singularities
- A Polynomial Time Complexity Bound for Computations on Curves
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- A simplified proof of desingularization and applications 👍 👎
- Complexity of computation of embedded resolution of algebraic curves 👍 👎
- Symbolic Hamburger-Noether expressions of plane curves and applications to AG codes 👍 👎
- Explicit resolution of plane curve singularities in arbitrary characteristic 👍 👎
- A fast algorithm for curve singularities 👍 👎
- Computing singular points of projective plane algebraic curves by homotopy continuation methods 👍 👎
This page was built for publication: The Computational Complexity of the Resolution of Plane Curve Singularities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3203147)
