 |
|
| HAL: hal-00658704, version 1 |
| Detailed view |  Export this paper |
 |
|
|
| On the complexity of polynomial reduction |
|
|
| Joris Van Der Hoeven 1 |
|
|
| For the ANR-Digiteo MaGiX collaboration(s) |
|
|
| (2012-01-11) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'informatique de l'école polytechnique (LIX) |
|
|
|
CNRS : UMR7161 – Polytechnique - X |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Mathematical Software |
|
|
| Sparse reduction – complexity – division – Groebner basis – algorithm |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00658704, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00658704 | |
| oai:hal.archives-ouvertes.fr:hal-00658704 | |
| From: Joris Van Der Hoeven | |
| Submitted on: Wednesday, 11 January 2012 03:26:43 | |
| Updated on: Wednesday, 11 January 2012 08:26:55 | |
