|Other publications ||or ||of 2002|
An Algorithm for Computing Weierstrass Points
Florian Hess, An Algorithm for Computing Weierstrass Points
. Algorithmic Number Theory ANTS 2002
. C. Fieker, D. R. Kohel, (eds.), pp. 357–371. July 2002. No electronic version available.
We develop algorithms for computing differentiations and Weierstrass points of algebraic curves in any characteristic. As an application we explain how this can be used to compute special models of curves together with a map to \mathbb P^1 of low degree.