An algorithm of computing $D$-gap numbers and $D$-Weierstrass points
Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 6-8
For a functional field associated with an algebraic curve and having any characteristic, an algorithm for computing $D$-gap numbers and $D$-Weierstrass points is described.
@article{PDM_2011_13_a0,
author = {E. S. Alekseenko},
title = {An algorithm of computing $D$-gap numbers and $D${-Weierstrass} points},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {6--8},
year = {2011},
number = {13},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2011_13_a0/}
}
E. S. Alekseenko. An algorithm of computing $D$-gap numbers and $D$-Weierstrass points. Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 6-8. http://geodesic.mathdoc.fr/item/PDM_2011_13_a0/