On the complexity of parametrizing curves

zbMath0894.68078MaRDI QIDQ2365251

Michal Mňuk, Franz Winkler, Juan Rafael Sendra

Publication date: 19 August 1998

Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/225339

zbMATH Keywords

bit complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of algebraic curves (14Q05)

Related Items

Approximate parametrization of plane algebraic curves by linear systems of curves ⋮ Computing all parametric solutions for blending parametric surfaces ⋮ Polynomial parametrization of curves without affine singularities

Uses Software

• CASA