The Computational Complexity of the Resolution of Plane Curve Singularities
From MaRDI portal
Publication:3203147
Recommendations
- A fast algorithm for curve singularities
- Explicit resolution of plane curve singularities in arbitrary characteristic
- Computational aspects of singularities
- A simplified proof of desingularization and applications
- scientific article; zbMATH DE number 5183769
- Complexity of computation of embedded resolution of algebraic curves
- Computing singular points of projective plane algebraic curves by homotopy continuation methods
- scientific article; zbMATH DE number 2212623
- scientific article; zbMATH DE number 2077105
- Symbolic Hamburger-Noether expressions of plane curves and applications to AG codes
Cites work
- scientific article; zbMATH DE number 3649988 (Why is no real title available?)
- scientific article; zbMATH DE number 3159118 (Why is no real title available?)
- scientific article; zbMATH DE number 3880854 (Why is no real title available?)
- scientific article; zbMATH DE number 3907766 (Why is no real title available?)
- scientific article; zbMATH DE number 3687501 (Why is no real title available?)
- scientific article; zbMATH DE number 3771547 (Why is no real title available?)
- scientific article; zbMATH DE number 3557181 (Why is no real title available?)
- scientific article; zbMATH DE number 3801699 (Why is no real title available?)
- scientific article; zbMATH DE number 3288410 (Why is no real title available?)
- scientific article; zbMATH DE number 3342122 (Why is no real title available?)
- All Algebraic Functions Can Be Computed Fast
- An Arithmetic Theory of Adjoint Plane Curves
- Fast parallel absolute irreducibility testing
- On Coates algorithm
- 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
Cited in
(23)- Algorithm for the semigroup of a space curve singularity
- Irreducibility criterion for algebroid curves
- scientific article; zbMATH DE number 6322905 (Why is no real title available?)
- 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]\)]]
- Algorithms for the implementation of the analytic classification of plane branches
- A regularization method for computing approximate invariants of plane curves singularities
- Linear differential operators for polynomial equations
- Computational aspects of singularities
- Complexity of computation of embedded resolution of algebraic curves
- Computer Algebra in Scientific Computing
- Effective computation of singularities of parametric affine curves
- Algorithms in Algebraic Number Theory
- A fast algorithm for curve singularities
- scientific article; zbMATH DE number 2077105 (Why is no real title available?)
- A Polynomial Time Complexity Bound for Computations on Curves
- A regularization approach for estimating the type of a plane curve singularity
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)
