Fast computation of generic bivariate resultants

Joris van der Hoeven (1, 2) , Grégoire Lecerf (3, 2, 1)

1 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
2 CNRS - Centre National de la Recherche Scientifique
3 MAX

We prove that the resultant of two "sufficiently generic" bivariate polynomials over a finite field can be computed in quasi-linear time.

Mots clés: complexity; algorithm; computer algebra; resultant; elimination; multipoint evaluation

Domaines: Calcul formel [cs.SC]; Complexité [cs.CC]; Algorithme et structure de données [cs.DS]; Algèbre commutative [math.AC]

Joris van der Hoeven, Grégoire Lecerf. Fast computation of generic bivariate resultants. Journal of Complexity, 2021, ⟨10.1016/j.jco.2020.101499⟩. ⟨hal-02080426⟩