×

zbMATH — the first resource for mathematics

On the complexity of parametrizing curves. (English) Zbl 0894.68078
Summary: Given a rational algebraic plane curve \({\mathcal C}\) in implicit representation, we analyze the bit complexity of an algorithm to describe \({\mathcal C}\) by parametric equations. Estimates for subalgorithms for computing the standard decomposition of singularities and the genus are also obtained.

MSC:
68Q25 Analysis of algorithms and problem complexity
14Q05 Computational aspects of algebraic curves
Keywords:
bit complexity
Software:
CASA
PDF BibTeX XML Cite
Full Text: EMIS EuDML