Probably faster multiplication of sparse polynomials
Résumé
In this paper, we present a probabilistic algorithm to multiply two sparse polynomials almost as efficiently as two dense univariate polynomials with a result of approximately the same size. The algorithm depends on unproven heuristics that will be made precise.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|