@inproceedings{bostan:hal-02917827, TITLE = {{A Simple and Fast Algorithm for Computing the $N$-th Term of a Linearly Recurrent Sequence}}, AUTHOR = {Bostan, Alin and Mori, Ryuhei}, URL = {https://inria.hal.science/hal-02917827}, NOTE = {15 pages. Version longue, 34 pages : https://specfun.inria.fr/bostan/BoMo20.pdf}, BOOKTITLE = {{SOSA'21 (SIAM Symposium on Simplicity in Algorithms)}}, ADDRESS = {Alexandria, United States}, YEAR = {2021}, MONTH = Jan, KEYWORDS = {Algebraic Algorithms ; Computational Complexity ; Linearly Recurrent Sequence ; Rational Power Series ; Fast Fourier Transform ; Algebraic Algorithms}, PDF = {https://inria.hal.science/hal-02917827v2/file/BoMo21-final.pdf}, HAL_ID = {hal-02917827}, HAL_VERSION = {v2}, }