Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities
Résumé
We revisit the seminal Brill-Noether algorithm for plane curves with ordinary singularities. Our new approach takes advantage of fast algorithms for polynomials and structured matrices. We design a new probabilistic algorithm of type Las Vegas that computes a Riemann-Roch space in expected sub-quadratic time.
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY - Paternité
Licence : CC BY - Paternité