Efficient resolution of singularities of plane curves

  • Dexter Kozen
Invited Talk

DOI: 10.1007/3-540-58715-2_109

Part of the Lecture Notes in Computer Science book series (LNCS, volume 880)
Cite this paper as:
Kozen D. (1994) Efficient resolution of singularities of plane curves. In: Thiagarajan P.S. (eds) Foundation of Software Technology and Theoretical Computer Science. FSTTCS 1994. Lecture Notes in Computer Science, vol 880. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • Dexter Kozen
    • 1
  1. 1.Computer Science DepartmentCornell UniversityIthacaUSA

Personalised recommendations