A simple and fast algorithm for computing the N-th term of a linearly recurrent sequence

DOI10.1137/1.9781611976496.14MaRDI QIDQ6538752FDOQ6538752

Authors: Alin Bostan, Ryuhei Mori 

Publication date: 14 May 2024

zbMATH Keywords

computational complexityfast Fourier transformalgebraic algorithmsrational power serieslinearly recurrent sequence

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: A simple and fast algorithm for computing the \(N\)-th term of a linearly recurrent sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538752)