Fast computation of generic bivariate resultants
Résumé
We prove that the resultant of two "sufficiently generic" bivariate polynomials over a finite field can be computed in quasi-linear time.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|