Abstract
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.
| Translated title of the contribution | An Algorithm for Computing Weierstrass Points |
|---|---|
| Original language | English |
| Title of host publication | Algorithmic Number Theory - ANTS 2002 |
| Editors | C. Fieker, D. R. Kohel |
| Publisher | Springer Berlin Heidelberg |
| Pages | 357 - 371 |
| Number of pages | 14 |
| Volume | 2369 |
| Publication status | Published - Jul 2002 |