An Algorithm for Computing Weierstrass Points

F Hess

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

4 Citations (Scopus)

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 contributionAn Algorithm for Computing Weierstrass Points
Original languageEnglish
Title of host publicationAlgorithmic Number Theory - ANTS 2002
EditorsC. Fieker, D. R. Kohel
PublisherSpringer Berlin Heidelberg
Pages357 - 371
Number of pages14
Volume2369
Publication statusPublished - Jul 2002

Bibliographical note

Conference Proceedings/Title of Journal: Algorithmic Number Theory ANTS 2002, LNCS 2369

Fingerprint Dive into the research topics of 'An Algorithm for Computing Weierstrass Points'. Together they form a unique fingerprint.

Cite this