Polynomial parametrization of curves without affine singularities

https://doi.org/10.1016/S0167-8396(02)00090-0Get rights and content

Abstract

This paper gives an algorithm for computing proper polynomial parametrizations for a particular class of curves. This class is characterized by the existence of a polynomial parametrization and by the absence of affine singularities. The algorithm requires O(n3logn) field operations, where n is the degree of the curve.

References (21)

There are more references available in the full text version of this article.

Cited by (5)

1

Supported by the Spanish Science and Technology Ministry PB97-0346.

2

Supported the Austrian Science Fund (FWF) in the frame of SFB 1303.

View full text