Efficient Resolution of Singularities of Plane Curves
We give a new algorithm for resolving singularities of plane curves. The algorithm is polynomial time in the bit complexity model, does not require factorization, and works over the rationals or finite fields.
computer science; technical report
Previously Published As