A fast algorithm for curve singularities
From MaRDI portal
Recommendations
Cites work
Cited in
(8)- Effective computation of singularities of parametric affine curves
- The Apery algorithm for a plane singularity with two branches
- An Algorithm for Computing the Singularity of the Generic Germ of a Pencil of Plane Curves
- The Computational Complexity of the Resolution of Plane Curve Singularities
- scientific article; zbMATH DE number 2077105 (Why is no real title available?)
- Complexity of computation of embedded resolution of algebraic curves
- Computer Algebra in Scientific Computing
- Singular points of algebraic curves
This page was built for publication: A fast algorithm for curve singularities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4822746)