Computing Riemann-Roch spaces via Puiseux expansions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Complexity Year : 2022

Computing Riemann-Roch spaces via Puiseux expansions


Computing large Riemann-Roch spaces for plane projective curves still constitutes a major algorithmic and practical challenge. Seminal applications concern the construction of arbitrarily large algebraic geometry error correcting codes over alphabets with bounded cardinality. Nowadays such codes are increasingly involved in new areas of computer science such as cryptographic protocols and "interactive oracle proofs". In this paper, we design a new probabilistic algorithm of Las Vegas type for computing Riemann-Roch spaces of smooth divisors, in characteristic zero, and with expected complexity exponent 2.373 (a feasible exponent for linear algebra) in terms of the input size.
Fichier principal
Vignette du fichier
rrgeneral (1).pdf (563.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03281757 , version 1 (08-07-2021)
hal-03281757 , version 2 (22-06-2022)



Simon Abelard, Elena Berardini, Alain Couvreur, Grégoire Lecerf. Computing Riemann-Roch spaces via Puiseux expansions. Journal of Complexity, 2022, ⟨10.1016/j.jco.2022.101666⟩. ⟨hal-03281757v2⟩
329 View
386 Download



Gmail Facebook X LinkedIn More