Bibliographic Details
| Title: |
LINEAR RECURRENCES WITH POLYNOMIAL COEFFICIENTS AND APPLICATION TO INTEGER FACTORIZATION AND CARTIER--MANIN OPERATOR. |
| Authors: |
Bostan, Alin1 alin.bostan@inria.fr, Gaudry, Pierrick2 gaudry@lix.polytechnique.fr, Schost, Éric2 schost@lix.polytechnique.fr |
| Source: |
SIAM Journal on Computing. 2007, Vol. 36 Issue 6, p1777-1806. 30p. 1 Chart. |
| Subjects: |
Factorization, Factorization of operators, Computational complexity, Algorithms, Mathematics research |
| Abstract: |
We study the complexity of computing one or several terms (not necessarily consecutive) in a recurrence with polynomial coefficients. As applications, we improve the best currently known upper bounds for factoring integers deterministically and for computing the Cartier-Manin operator of hyperelliptic curves. [ABSTRACT FROM AUTHOR] |
|
Copyright of SIAM Journal on Computing is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
