Skip to main content
Conference Proceedings

An algorithm for computing weierstrass points

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2369 357-371
DOI: 10.1007/3-540-45455-1_29
5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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 P1 of low degree.

Cite

CITATION STYLE

APA

Hess, F. (2002). An algorithm for computing weierstrass points. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2369, pp. 357–371). Springer Verlag. https://doi.org/10.1007/3-540-45455-1_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free