output
20162025
most citedA Fast Randomized Geometric Algorithm for Computing Riemann-Roch Spaces

14 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.SCShow all

4 papers · 1 filter

cs.SC2023

Algorithms for computing norms and characteristic polynomials on general Drinfeld modules

Xavier Caruso, Antoine Leudière

We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of…

cs.SC2018★ 14 cited

A Fast Randomized Geometric Algorithm for Computing Riemann-Roch Spaces

Aude Le Gluher, Pierre-Jean Spaenlehauer

We propose a probabilistic variant of Brill-Noether's algorithm for computing a basis of the Riemann-Roch space associated to a divisor on a projective nodal plane curve…

cs.SC2016★ 1 cited

Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems

Jean-Charles Faugere, Pierre-Jean Spaenlehauer, Jules Svartz

B{é}zout 's theorem states that dense generic systems of n multivariate quadratic equations in n variables have 2 n solutions over algebraically closed fields. When only a small su…

cs.SC2016★ 1 cited

Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix

Jean-Guillaume Dumas, Erich Kaltofen, Emmanuel Thomé +1

Computational problem certificates are additional data structures for each output, which can be used by a-possibly randomized-verification algorithm that proves the correctness of…