Invited Talk

Foundation of Software Technology and Theoretical Computer Science

Volume 880 of the series Lecture Notes in Computer Science pp 1-11

Date:

Efficient resolution of singularities of plane curves

  • Dexter KozenAffiliated withComputer Science Department, Cornell University

Abstract

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 (ℚ) or finite fields.