On the complexity of polynomial reduction
Résumé
In this paper, we present a new algorithm for reducing a multivariate polynomial with respect to an autoreduced tuple of other polynomials. In a suitable sparse complexity model, it is shown that the execution time is essentially the same (up to a logarithmic factor) as the time needed to verify that the result is correct. This is a first step towards making advantage of fast sparse polynomial arithmetic for the computation of Gröbner bases.
Domaines
Logiciel mathématique [cs.MS]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...