=ADD=
=reftype=
14
=number=
00-20
=url=
ftp://ftp.risc.uni-linz.ac.at/pub/techreports/2000/00-20.ps.gz
=year=
2000
=month=
06
=author=
Stadelmeyer; Peter
=title=
Computing the System of Adjoint Plane Curves by Puiseux Expansion, Part III: Computational Complexity
=abstract=
Let $\acurveC$ be an irreducible algebraic curve in the affine plane.
The main result of this paper is a detailed complexity analysis of 
the Newton--Puiseux algorithm used to resolve the singularities of
$\curveC$.
This analysis is then used to estimate the computational complexity
for computing the linear system of adjoint curves of $\curveC$
of some given degree.
=sponsor=
FWF project number P11160-TEC ``HySaX''
=keywords=
algebraic geometry, plane curves, resolution, Puiseux series, singularities, computational complexity