Homotopy techniques for multiplication modulo triangular sets
Résumé
We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li et al. (2007), we propose an algorithm that relies on homotopy and fast evaluation-interpolation techniques. We obtain a quasi-linear time complexity for substantial families of examples, for which no such result was known before. Applications are given notably to additions of algebraic numbers in small characteristic.
Domaines
Calcul formel [cs.SC]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|